Time complexity calculation 1. Suppose there is an ordered list of 128 names. You need to use binary search to find one of them. How many steps does it take to find it? 2. After doubling the length of the above list, how many steps are required at most? 3. Analyze the program and find the time complexity of the algorithm 2) y=0; |( 3 ) for(i=1;i<=n;i++) (1) l;k=0; while(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...
icon
Related questions
Question
Question
Time complexity calculation
1. Suppose there is an ordered list of 128 names. You need to use binary search to find one of them.
How many steps does it take to find it?
2. After doubling the length of the above list, how many steps are required at most?
3. Analyze the program and find the time complexity of the algorithm
2)
( 3 ) for(i=1;i<=n;i++)
(1) i=l;k=0;
while(i<n-1){
k=k+10*i;
i++;
y=0;
while ((y+1)*(y+1)<=n)
y=y+1;
for(j=1;j <=i;j++)
for(k=l;k<=j;k++)
X++;
(4) for(i=0;i<n;i++)
for(j=0;j<m;j++)
a[i] [i]=0;
Transcribed Image Text:Question Time complexity calculation 1. Suppose there is an ordered list of 128 names. You need to use binary search to find one of them. How many steps does it take to find it? 2. After doubling the length of the above list, how many steps are required at most? 3. Analyze the program and find the time complexity of the algorithm 2) ( 3 ) for(i=1;i<=n;i++) (1) i=l;k=0; while(i<n-1){ k=k+10*i; i++; y=0; while ((y+1)*(y+1)<=n) y=y+1; for(j=1;j <=i;j++) for(k=l;k<=j;k++) X++; (4) for(i=0;i<n;i++) for(j=0;j<m;j++) a[i] [i]=0;
Expert Solution
steps

Step by step

Solved in 7 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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 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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY