算法c语言实现 5-6 用分治法求最大值

  1 #include <stdlib.h>
  2 
  3 int max(int a[], int i, int j){
  4     int u;
  5     int v;
  6     int m = (i+j)/2;
  7     if(i == j){
  8         return a[i];
  9     }
 10     u = max(a, i, m);
 11     v = max(a, m+1, j);
 12     return u > v ? u : v ;
 13 }
 14 
 15 void main(int argc, char* argv[]){
 16     int n = atoi(argv[1]);
 17     int i;
 18     int a[n];
 19     for(i = 0; i<n; i++){
 20         a[i] = rand()%1000;
 21         printf("%d\n", a[i]);
 22     }
 23     n = max(a, 0, n);
 24     printf("%d\n", n);
 25 }