What is the time complexity of the following C language function, which assumes that matrix[][] is an nxn matrix. int addMatrix(int ** matrix, int n) { int sum = 0; int k; for (k = 2; k< n; k=k*k) { sum = sum + k; } for (int m = 1; m*m < k; m=m+1) { for (int r = 0; r< n; r = r+m) { sum += r; }
What is the time complexity of the following C language function, which assumes that matrix[][] is an nxn matrix. int addMatrix(int ** matrix, int n) { int sum = 0; int k; for (k = 2; k< n; k=k*k) { sum = sum + k; } for (int m = 1; m*m < k; m=m+1) { for (int r = 0; r< n; r = r+m) { sum += r; }
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
![What is the time complexity of the following C language function, which assumes that
matrix[][] is an nxn matrix.
int addMatrix(int ** matrix, int n)
{
int sum = 0;
int k;
for (k = 2; k< n; k=k*k) {
sum = sum + k;
for (int m 1; m*m < k; m=m+1) {
for (int r = 0; r< n; r = r+m) {
sum += r;
}](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F13588074-fa49-4a20-9a58-231f1d9ed39d%2F17929255-b665-462f-a376-247958ebf82f%2Fhqw0kzr_processed.jpeg&w=3840&q=75)
Transcribed Image Text:What is the time complexity of the following C language function, which assumes that
matrix[][] is an nxn matrix.
int addMatrix(int ** matrix, int n)
{
int sum = 0;
int k;
for (k = 2; k< n; k=k*k) {
sum = sum + k;
for (int m 1; m*m < k; m=m+1) {
for (int r = 0; r< n; r = r+m) {
sum += r;
}
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps

Recommended textbooks for you

Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON

Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science

Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning

Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON

Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science

Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning

Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning

Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education

Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY