In a binary search algorithm, if the element to be searched is lesses than the pivot value (middle value), then is split in half. Right interval
Answer options
A
Left interval
B
Half interval
C
Complier dependent
Correct answer: Left interval
Explanation
In binary search, when the target element is less than the pivot (middle value), the search continues in the Left interval (lower half) of the array.