Searching Algorithms: Binary Search for Competitive Exams

Searching Algorithms: Binary Search - Implementations in Python - Higher Difficulty Problems

Q. If the array is [1, 2, 3, 4, 5] and the target is 3, what will be the mid index during the first iteration of binary search?

Solution

In the first iteration, mid is calculated as (0 + 4) // 2 = 2, which corresponds to the value 3.

Correct Answer: C — 2

Q. In a binary search implementation, what is the condition to continue searching?

Solution

The search continues as long as the left index is less than or equal to the right index.

Correct Answer: A — left <= right

Q. What happens if the binary search algorithm is applied to an unsorted array?

Solution

Binary search will not work correctly on an unsorted array and may return incorrect results.

Correct Answer: C — It may return incorrect results

Showing 1 to 3 of 3 (1 Pages)