Binary Search BinarySearch(A, key) 1. mid e (low + high)/2 2. while (A[mid]!=key) and ( low<=high) 3. if (key>A[mid]) 4. low + mid +1 5. else 6 . high e mid - 1 7. mid +(low + high)/2 8. if (low<=high) T(n)=1+k+(k-1)+(k-1)+(k-1)+1+1 = 4K= 4 log2n © 9. return true O(log2n) 10. else n/2 + n/4 + n/8 + n/2k 11. return false 2K<=n k=log2n
Binary Search BinarySearch(A, key) 1. mid e (low + high)/2 2. while (A[mid]!=key) and ( low<=high) 3. if (key>A[mid]) 4. low + mid +1 5. else 6 . high e mid - 1 7. mid +(low + high)/2 8. if (low<=high) T(n)=1+k+(k-1)+(k-1)+(k-1)+1+1 = 4K= 4 log2n © 9. return true O(log2n) 10. else n/2 + n/4 + n/8 + n/2k 11. return false 2K<=n k=log2n
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
Dry run this
Note:
Traverse it for worst case and array must be greater than 5 elements.
![Binary Search
BinarySearch(A, key)
1. mid e (low + high)/2
2. while (A[mid]!=key) and ( low<=high)
3.
if (key>A[mid])
4.
low + mid +1
5.
else
6 .
high e mid - 1
mid E(low + high)/2
7.
8. if (low<=high)
T(n)=1+k+(k-1)+(k-1)+(k-1)+1+1
= 4K= 4 log2n ©
9.
return true
O(log;n)
10. else
+ n/2k
k=log2n
n/2 + n/4 + n/8
11.
return false
2K<=n](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F3180ce64-3f6f-401b-935c-625462235384%2F9738a06e-f8e4-46b5-90e2-ecd7ee27619a%2F8kmwd5_processed.png&w=3840&q=75)
Transcribed Image Text:Binary Search
BinarySearch(A, key)
1. mid e (low + high)/2
2. while (A[mid]!=key) and ( low<=high)
3.
if (key>A[mid])
4.
low + mid +1
5.
else
6 .
high e mid - 1
mid E(low + high)/2
7.
8. if (low<=high)
T(n)=1+k+(k-1)+(k-1)+(k-1)+1+1
= 4K= 4 log2n ©
9.
return true
O(log;n)
10. else
+ n/2k
k=log2n
n/2 + n/4 + n/8
11.
return false
2K<=n
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 3 steps with 2 images
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