Computer Science, asked by anujssmishra3931, 1 year ago

In a binary search, if the value of the search element is lesser than the item in the middle of this interval, then ______________ is split in half.

Answers

Answered by tiara5
0
Search interval or the whole array is split in half
Similar questions