<span>查找旋转数组的最小值</span>

 1 /***************************************
 2 FileName FindMinRotateArray.cpp
 3 Author : godfrey
 4 CreatedTime : 2016/5/3
 5 ****************************************/
 6 #include <iostream>
 7 #include <cstring>
 8 #include <vector>
 9 #include <algorithm>
10 #include <stdio.h>
11 #include <stdlib.h>
12 
13 using namespace std;
14 
15 int FindMinRotateArray(int* A,int size){
16     int Low = 0;
17     int High = size-1;
18     int mid;
19     while(Low < High){
20         mid = (Low + High) / 2;
21         if(A[mid] > A[High]){ //最小值在右半部份
22             Low = mid + 1;
23         }
24         else if(A[mid] < A[High]){//最小值在左半部分
25             High = mid;
26         }
27     }
28     return A[Low];
29 }
30 int main()
31 {
32     int a[] = {4,5,6,7,1,2,3};
33     int FindMinNum = FindMinRotateArray(a,sizeof(a)/sizeof(int));
34     cout<<"the FindMinNum: ";
35     cout<<FindMinNum<<endl;
36     return 0;
37 }