同时找数组里的最大最小数——分治思想

#include<iostream>
using namespace std;

void maxMin(int* arr,int p,int r,int &min,int &max)
{
if(p<r)
{
int q = (p+r)/2;
int lmin,lmax,rmin,rmax;
maxMin(arr,p,q,lmin,lmax);
maxMin(arr,q+1,r,rmin,rmax);
min = lmin<rmin?lmin:rmin;
max = lmax>rmax?lmax:rmax;
}
else
{
min = max = arr[p];
}
}
int main()
{
int arr[] = {5,6,8,3,7,9};
int min,max;
int len = sizeof(arr)/sizeof(arr[0]);
maxMin(arr,0,len-1,min,max);
cout<<min<<" "<<max;
getchar();
return 0;
}