Question
Consider the binary search algorithm we saw in lecture. Suppose A=(2,4,5,6,9,11,12,15,20). a) Suppose we are looking for the value 4. Which numbers will be compared
Consider the binary search algorithm we saw in lecture. Suppose A=(2,4,5,6,9,11,12,15,20).
a) Suppose we are looking for the value 4. Which numbers will be compared with 4? How many total comparisons were performed?
b) Suppose we are looking for the value 13. Which numbers will be compared with 13? How many total comparisons were performed?
c) Suppose we are looking for the value 0. Which numbers will be compared with 0? How many total comparisons were performed?
d) Suppose now that A=(2,4,3,8,12,10,6) and we are looking for the value 6. Which numbers will be compared to 6? What happens? Why?
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Database Theory Icdt 99 7th International Conference Jerusalem Israel January 10 12 1999 Proceedings Lncs 1540
Authors: Catriel Beeri ,Peter Buneman
1st Edition
3540654526, 978-3540654520
