Given a rotated sorted array, find the MIN of the array.

Thanks to binary search ,this can be done in O(logn)
if you divide a rotated sorted array into arr[l]…arr[mid] and arr[mid+1].. arr[h] ,then one of the 2 subarrays will be sorted.Ignore the sorted array and keep searching in the unsorted array(in which first element will be greater than last element)

	#include<iostream>
	using namespace std;
	int main(){
	int arr[]={880,982,99,10,55,66,77,78};
	int l=0;
	int h=sizeof(arr)/sizeof(int)-1;
	int mid;
	while(arr[l]>arr[h]){
	mid=l+(h-l)/2;
	if(arr[mid]>arr[h]){
	l=mid+1;
	}
	else
	h=mid;
	}
	cout<<arr[l];
	}

view raw

mininrotatedsortedarray

hosted with ❤ by GitHub