Algoritmi:
Dastur kodi:
1. #include "matrix.h"
2. #include
3. #include
4. #include "omp.h"
316
5.
6. int main() {
7. for (int n = 50; n < 350; n += 50) {
8. std::vector > matrix(n);
9.
10.for (int i = 0; i < n; ++i) {
11.matrix[i].resize(n);
12.for (int j = 0; j < n; ++j)
13.matrix[i][j] = rand();
14.}
15.
16.std::vector column(n);
17.for (int j = 0; j < n; ++j)
18.column[j] = rand();
19.
20.double start_time = omp_get_wtime();
21.
22.std::vector solution = cramer_solving(matrix, column, n);
23.
24.std::cout << n << " " << omp_get_wtime() - start_time << std::endl;
25.}
26.}
Nazorat savollari:
1. SP deganda nimani tushunasiz?
2. SPning qanday xususiyatlarini bilasiz?
3. SP arxitekturalari haqida ma’lumot bering?
4. Garvard arxitekturasi qanday afzallikka ega?
Do'stlaringiz bilan baham: |