Write a program to find minimum and maximum value in an array using divide and conquer.

#include<iostream.h>
#include<conio.h>
int minimum(int x,int y,int *numbers);
int maximum(int x,int y,int *numbers);

int max(int value1, int value2)
{
   return ( (value1 > value2) ? value1 : value2);
}

int min(int value1, int value2)
{
   return ( (value1 < value2) ? value1 : value2);
}
void main(){
	int num[]={5,3,7,9,1,2,0,8,4,6};
	cout<<minimum(0,9,num);
	cout<<maximum(0,9,num);
}
int minimum(int x,int y,int *numbers){
	int min1,min2;
	if((y-x) <=1){
		return min(numbers[x],numbers[y]);
	}
	else{
		min1=minimum(x,(((x+y)/2)),numbers);
		min2=minimum((((x+y)/2)+1),y,numbers);
	}
	return min(min1,min2);
}

int maximum(int x,int y,int *numbers){
	int max1,max2;
	if((y-x) <=1){
		return max(numbers[x],numbers[y]);
	}
	else{
		max1=maximum(x,(((x+y)/2)),numbers);
		max2=maximum((((x+y)/2)+1),y,numbers);
	}
	return max(max1,max2);
}