which searching algorithm involves using a low, middle, and high index value to find the location of a value in a sorted set of data (if it exists)? mark for review (1) points sequential search merge sort selection sort binary search all of the above
Answers
Answered by
0
Answer:
Binary search involves a low, middle and high index value.
Similar questions