Follow up for "Find Minimum in Rotated Sorted Array":
What if duplicates are allowed?Would this affect the run-time complexity? How and why?
Suppose a sorted array is rotated at some pivot unknown to you beforehand.
(i.e., 0 1 2 4 5 6 7
might become 4 5 6 7 0 1 2
).
Find the minimum element.
The array may contain duplicates.
#include<stdio.h>
int
#include<stdio.h>
int findMin(int num[],int n) {
int i=0;
if(num[0]<num[n-1]) return num[0];
else{
for(i=0;i<n;i++) {
//printf("%d",num[i]);
if(num[0]>num[i]) return num[i];
}
}
return num[i-1];
}
void main(){
int num[]={1};
printf("%d\n",findMin(num,1));
}