Try to analyze the time complexity of the following algorithms. 1 // (1) 2 3 4 5 6 7 8 9 10 } 1 2 3 4 1 2 3 4 5 6 x = 90; y = 100; while(y > 0) { if(x > 100) { }else{ } x = x - 10; y--; X++; // (2) for (i = 0; i
Try to analyze the time complexity of the following algorithms. 1 // (1) 2 3 4 5 6 7 8 9 10 } 1 2 3 4 1 2 3 4 5 6 x = 90; y = 100; while(y > 0) { if(x > 100) { }else{ } x = x - 10; y--; X++; // (2) for (i = 0; i
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
![Try to analyze the time complexity of the following algorithms.
1 // (1)
2
3
4
01
5
6
7
8
9
10 }
1
2
3
4
X = 90; y = 100;
while(y > 0) {
1
2
3
4
5
6
if (x > 100) {
}else{
}
x = x - 10;
y--;
X++;
// (2)
for (i = 0; i<n; i++)
for (j
a[i][j]
sum = S;
=
0; j < m; j++)
0;
=
// (3)
S = 0;
for (i = 0; i<n; i++)
for(j = 0; j < n; j++)
s += B[i][j];
4
LO
1
2
3
4
LO
5
1
2
3
+
5
// (4)
i
1;
while(i <= n)
i = 1*3;
// (5)
X = 2;
while(x <n/2)
x = x * 2;
// (6)
X = 0;
for(i=
1; i<n; i++)
for (j = 1; j <= n-i; j++)
X++;
=
1
2
W
4
5
1
2
4
5
6
// (7)
x = 0;
for (k
1; k <= n; k*=2)
for (j 1; j <= n; j++)
X++;
}
=
=
// (8)
int fact(int n) {
if(n <= 1)
return 1;
return n*fact(n-1);
4](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F594b5bd7-6e89-44b0-bd04-235da8fcbb3f%2F7d2bcb30-d8cc-4f25-931d-70e4d6640b37%2Ffryub5q_processed.png&w=3840&q=75)
Transcribed Image Text:Try to analyze the time complexity of the following algorithms.
1 // (1)
2
3
4
01
5
6
7
8
9
10 }
1
2
3
4
X = 90; y = 100;
while(y > 0) {
1
2
3
4
5
6
if (x > 100) {
}else{
}
x = x - 10;
y--;
X++;
// (2)
for (i = 0; i<n; i++)
for (j
a[i][j]
sum = S;
=
0; j < m; j++)
0;
=
// (3)
S = 0;
for (i = 0; i<n; i++)
for(j = 0; j < n; j++)
s += B[i][j];
4
LO
1
2
3
4
LO
5
1
2
3
+
5
// (4)
i
1;
while(i <= n)
i = 1*3;
// (5)
X = 2;
while(x <n/2)
x = x * 2;
// (6)
X = 0;
for(i=
1; i<n; i++)
for (j = 1; j <= n-i; j++)
X++;
=
1
2
W
4
5
1
2
4
5
6
// (7)
x = 0;
for (k
1; k <= n; k*=2)
for (j 1; j <= n; j++)
X++;
}
=
=
// (8)
int fact(int n) {
if(n <= 1)
return 1;
return n*fact(n-1);
4
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
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