Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- #include <time.h>
- int test1(int **m1, int **m2, int **m3, int n) {
- int i, j, k;
- for (i = 0; i < n; ++i) {
- for (k = 0; k < n; ++k) {
- for (j = 0; j < n; ++j) {
- m3[i][j] += m1[i][k] * m2[k][j];
- }
- }
- }
- }
- int test2(int *m1, int *m2, int *m3, int n) {
- int i, j, k;
- for (i = 0; i < n; ++i) {
- for (k = 0; k < n; ++k) {
- for (j = 0; j < n; ++j) {
- m3[i*n + j] += m1[i*n + k] * m2[k*n + j];
- }
- }
- }
- }
- int main(int argc, char *argw[]) {
- int size;
- int **m1, **m2, **m3;
- int *a1, *a2, *a3;
- int i, j;
- clock_t time1, time2;
- scanf("%d", &size);
- m1 = (int **) malloc(sizeof(int *) * size);
- m2 = (int **) malloc(sizeof(int *) * size);
- m3 = (int **) malloc(sizeof(int *) * size);
- for (i = 0; i < size; ++i) {
- m1[i] = (int *) malloc(sizeof(int *) * size);
- m2[i] = (int *) malloc(sizeof(int *) * size);
- m3[i] = (int *) malloc(sizeof(int *) * size);
- for (j = 0; j < size; ++j) {
- m1[i][j] = i+j;
- m2[i][j] = i-j;
- m3[i][j] = 0;
- }
- }
- a1 = (int *) malloc(sizeof(int) * size * size);
- a2 = (int *) malloc(sizeof(int) * size * size);
- a3 = (int *) malloc(sizeof(int) * size * size);
- for (i = 0; i < size; ++i) {
- for (j = 0; j < size; ++j) {
- a1[i*size + j] = i+j;
- a2[i*size + j] = i-j;
- a3[i*size + j] = 0;
- }
- }
- time1 = clock();
- test1(m1, m2, m3, size);
- time1 = clock() - time1;
- time2 = clock();
- test2(a1, a2, a3, size);
- time2 = clock() - time1;
- printf("%lf %lf\n", (double) time1/CLOCKS_PER_SEC, (double) time2/CLOCKS_PER_SEC);
- }
Advertisement
Add Comment
Please, Sign In to add comment