算法选最大最小问题

//假设只对只有十个元素的数组，进行选最大的和最小的，代码如下: 
#include <iostream> 
#include <vector> 
using namespace std; 
void max_min(vector<int> v,int i,int j,int &max_n, int &min_n) 
{ 
	//子问题规模较小，解决子问题 
	if (i == j) 
	{ 
		max_n = v[i]; 
		min_n = v[i]; 
		return ; 
	}
	else if ( i+1 == j) 
	{ 
		if (v[i]<v[j]) 
		{ 
			max_n = v[j]; 
			min_n = v[i]; 
		} 
		else 
		{ 
			min_n = v[j]; 
			max_n = v[i]; 
		} 
		return ; 
	}
	//分解原问题为更小的子问题 
	int max1_n,min1_n,max2_n,min2_n; 
	max_min(v,i,(i+j)/2,max1_n,min1_n); 
	max_min(v,(i+j)/2+1,j,max2_n,min2_n); 
	//合并子问题 
	max_n = max1_n>max2_n?max1_n:max2_n; 
	min_n = min1_n<min2_n?min1_n:min2_n; 
	return; 
} 
int main() 
{ 
	vector<int> v; 

	v.push_back(3); 
	v.push_back(6);
	v.push_back(1);
	v.push_back(8);
	v.push_back(2);
	v.push_back(9);
	v.push_back(0);
	v.push_back(5);
	v.push_back(7);
	v.push_back(4);

	for (int i=0;i<10;++i) 
	{ 
		cout<<v[i]<<‘ ‘; 
	} 
	cout<<endl; 
	int max_n,min_n; 
	max_min(v,0,9,max_n,min_n); 
	cout<<"最大数："<<max_n<<‘\t‘<<"最小数:"<<min_n<<endl; 
	system("pause");
	return 0; 
}