分治法求最大最小值

[c++]代码库

#include<iostream>
using namespace std;

class object{
	public:
		
	int max;
	int min;
	
};

object min_max(int array[],int first,int last){
	
	object obj_1;
	
	if(last-first<2){
		
		
		obj_1.max=array[first]>array[last]?array[first]:array[last];
        obj_1.min=array[first]>array[last]?array[last]:array[first];
	}
	
	else{
		
		int mid = (first+ last)/2;
        object p1 = min_max(array,first,mid);
        object p2 = min_max(array,mid+1,last);
        obj_1.max = p1.max>p2.max ? p1.max : p2.max;
        obj_1.min = p1.min<p2.min ? p1.min : p2.min;
        }
        return obj_1;
		
		
	}




int main(){
	
	int a[4]={1,3,4,5};
    object pair = min_max(a,0,3);
    cout<<pair.max<<endl;
    cout<<pair.min<<endl;
}