In a binary search algorithm, if the element to be searched is greater than the pivot value (middle value), then ______________ is split in half. Select one:
a. Left interval
b. Half interval
c. Right interval
d. Compiler dependent
Answers
Answered by
2
Answer:
right interval (option c)
Answered by
1
It is C, right interval.
Similar questions