What happens when binary search is applied to an unsorted array?
Answers
Answered by
0
You can use binary search on only one kind of "unsorted" array - the rotatedarray. It can be done in O(log n) time like a typical binary search, but uses an adjusted divide and conquer approach. ... "Binary search" checks if the value is in left or right side, comparing when it's lesser or bigger than the central item.
Similar questions