Question

The method that’s usually used to look up an entry in a phone book is not exactly
the same as a binary search because, when using a phone book, you don’t always
go to the midpoint of the sublist being searched. Instead, you estimate the position
of the target based on the alphabetical position of the first letter of the person’s last
name. For example, when you are looking up a number for “Smith,” you look
toward the middle of the second half of the phone book first, instead of in the
middle of the entire book. Suggest a modification of the binary search algorithm
that emulates this strategy for a list of names. Is its computational complexity any
better than that of the standard binary search? [Anyone solve me this! please !]

Answer 1

Answer:

Explanation:

in a phone book is not exactly the same as a binary search because, when u. ... Instead, We Estimate The Position Of The Target Based On The Alphabetical ... The method we usually use to look up an entry in a phone book is not exactly the ... phone book, we don't always go to the midpoint of the sublist being searched.