Searching Algorithms: Binary Search for Competitive Exams

Searching Algorithms: Binary Search - Complexity Analysis

Q. If an array has 16 elements, how many comparisons will binary search make in the worst case?

Solution

In the worst case, binary search will make at most log2(16) = 4 comparisons.

Correct Answer: B — 5

Q. If the size of the array is doubled, how does the time complexity of binary search change?

Solution

The time complexity of binary search is O(log n), which does not change with the size of the array.

Correct Answer: B — It remains the same

Q. In binary search, what happens if the middle element is greater than the target?

Solution

If the middle element is greater than the target, the search continues in the left half of the array.

Correct Answer: A — Search the left half

Showing 1 to 3 of 3 (1 Pages)