编程之美2.10寻找数组中的最大值和最小值代码

#include <iostream>

using namespace std;

void FindMaxAndMin(int num[],int l,int r,int &minNum,int &maxNum);

int main()
{
int n = 6;
int num[] = {6,5,8,3,9,7};
int minNum,maxNum;

FindMaxAndMin(num,0,n-1,minNum,maxNum);
for(int i=0 ; i<n ; i++){
cout << num[i] << " ";
}
cout << endl;

cout << minNum << " " <<maxNum<< endl;
return 0;
}
void FindMaxAndMin(int num[],int l,int r,int &minNum,int &maxNum)
{
int minl,maxl,minr,maxr;

if(r - l == 0){
minNum = num[r];
maxNum = num[r];
return ;
}
if(r - l == 1){
if(num[r] > num[l]){
maxNum = num[r];
minNum = num[l];
}
else{
maxNum = num[l];
minNum = num[r];
}
return ;
}
FindMaxAndMin(num,l,(l+r)/2,minl,maxl);
FindMaxAndMin(num,1+(l+r)/2,r,minr,maxr);
//merge
if(minl < minr){
minNum = minl;
}
else{
minNum = minr;
}
if(maxl > maxr){
maxNum = maxl;
}
else{
maxNum = maxr;
}

}