二分法求解数列中最小的数

#include <stdio.h> 
#include <stdlib.h> 

int count=0;


int Merge(int a,int b)
{ 
   int c;
   if (a<=b)
      return a;
   else  
      return b; 
}


int MergeSort(int r[], int s,int t)
{
int min, c1, c2; 


if(s==t) return r[s];


else
{
int c1, c2;
int m=(s+t)/2;
printf("****** s, m, t %d %d %d\n", s, m, t);
c1=MergeSort(r, s,m);
printf("c1= %d\n",c1);


printf("###### s, m, t %d %d %d\n", s, m, t);
//printf("\n");
c2=MergeSort(r, m+1,t);
printf("c2= %d\n",c2);
printf("%d %d %d\n",s, m, t);


min=Merge(c1, c2);
count++;
printf("第 count= %d 次合并完！ c1= %d c2= %d min= %d\n\n", count, c1, c2, min);


return min;
}


}


int main()
{
int r[8]={10,3,5,1,9,54,565,34};
int min;


min=MergeSort(r, 0,7);
printf("%d ", min);


system ("pause");
return 0;   
}