Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Correct and detailed answer will be Upvoted In C Question: How can the function, matrix_initialize_unopt, be optimized and rewritten with loop collapsing? n has a size of 3000   struct fn_args { int n; int *mem1; int *mem2; };   int check(int x, int y) { return x < y; }   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); } } }

Correct and detailed answer will be Upvoted In C Question: How can the function, matrix_initialize_unopt, be optimized and rewritten with loop collapsing? n has a size of 3000   struct fn_args { int n; int *mem1; int *mem2; };   int check(int x, int y) { return x < y; }   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); } } }

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question

Correct and detailed answer will be Upvoted

In C

Question: How can the function, matrix_initialize_unopt, be optimized and rewritten with loop collapsing? n has a size of 3000

 

struct fn_args {

int n;

int *mem1;

int *mem2;

};

 

int check(int x, int y) {

return x < y;

}

 

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);

}

}

}

Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Randomized Select Algorithm
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS