Search an element in sorted rotated array.

• Use binary search to find the pivot point where the array is rotated.

• Divide the array into two subarrays and perform binary search on the appropriate subarray...read more

An element in a sorted array can be found in O(log n) time via . Binary seach suppose we rotate an ascending order sorted array at some pivot unknown to you beforehand. So for instance, 1 2 3 4 5 migh...read more

Binary seach