Suppose that L is a sorted list of size 1024, and we want to determine whether an item x is in L.From the binary search algorithm, it follows that every iteration of the while loop cuts the size of the search list by half.

Question

Quizplus · Accepted Answer

Yes, every iteration of binary search algorithm cuts the size of the search list by half. Therefore, after log₂(1024) iterations, the list will be reduced to a single item.

Suppose That L Is a Sorted List of Size 1024