If a is an array that contains the values from 1 to 100 in order. How may comparisons are done to search for 50 using the binary search algorithm ?
If a is an array that contains the values from 1 to 100 in order. How may comparisons are done to search for 50 using the binary search algorithm ?
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
![If a is an array that contains the values from 1 to 100 in order. How may comparisons
are done to search for 50 using the binary search algorithm ?
hint: 50 is at index 50 in the array.
Binary search code:
int [] a = new int[100];
for (int i
a[i]
}
int key
7
0; i < a.length; i++) {
i+1;
8
9.
10
50;
boolean found =
11
%3D
12
false;
int low
0;
a.length
while(low <= high && !found){
int mid = (1low + high) / 2;
a[mid])
13
14
int high
1;
15
16
17
if(key
==
18
found
true;
else if(key > a[mid])
low = mid + 1;
%3D
19
20
21
else
22
high
mid
1;
23](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fb849a623-4c59-4625-854d-b538b3e0e746%2Fd8785531-0df6-4f4f-bd14-add6508ce5f2%2F7har0w_processed.png&w=3840&q=75)
Transcribed Image Text:If a is an array that contains the values from 1 to 100 in order. How may comparisons
are done to search for 50 using the binary search algorithm ?
hint: 50 is at index 50 in the array.
Binary search code:
int [] a = new int[100];
for (int i
a[i]
}
int key
7
0; i < a.length; i++) {
i+1;
8
9.
10
50;
boolean found =
11
%3D
12
false;
int low
0;
a.length
while(low <= high && !found){
int mid = (1low + high) / 2;
a[mid])
13
14
int high
1;
15
16
17
if(key
==
18
found
true;
else if(key > a[mid])
low = mid + 1;
%3D
19
20
21
else
22
high
mid
1;
23
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 3 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