Question: Based on the C code given below, matrix_initialize_unopt is an unoptimized version of matrix initialiaztion and matrix_initialize_opt is an optimized version of matrix initialization. How would matrix_initialize_opt be written? #define X 500 #define Y 12 #define Z 8 struct fn_args { int n; int mem1; int mem2; }; void set(int mat, int i, int num) { mat[i] = num; } void matrix_initialize_unopt(struct fn_args args) { int i, j, n; int mat1, mat2; n = args->n; mat1 = args->mem1; mat2 = args->mem2; for (i = 0; check(i, n); i++){ for (j = 0; check(j, n); j++){ set(mat1, i * n + j, i); set(mat2, i * n + j, i+1); } } } void matrix_initialize_opt(struct fn_args *args) { // XXX: optimized implementation goes here }

Question

Question: Based on the C code given below, matrix_initialize_unopt is an unoptimized version of matrix initialiaztion and matrix_initialize_opt is an optimized version of matrix initialization. How would matrix_initialize_opt be written? #define X 500 #define Y 12 #define Z 8 struct fn_args { int n; int *mem1; int *mem2; }; void set(int *mat, int i, int num) { mat[i] = num; } void matrix_initialize_unopt(struct fn_args *args) { int i, j, n; int *mat1, *mat2; n = args->n; mat1 = args->mem1; mat2 = args->mem2; for (i = 0; check(i, n); i++){ for (j = 0; check(j, n); j++){ set(mat1, i * n + j, i); set(mat2, i * n + j, i+1); } } } void matrix_initialize_opt(struct fn_args *args) { // XXX: optimized implementation goes here }