ALGORITMA DIVIDE AND CONQUERE

algoritma divide and conquere
#include
#include
int max, min;
int a[100];
void maxmin (int i, int j);
{
int max1, min1, mid;
if (i==j);
max = min = a[i];
else
if (i==j-1);
{
if (a[i] < a[j]);
{
max = a[i];
min = a[j];
}
else
{
max = a[i];
min = a[j];
}
}
else
{
mid (i+j)/2;
maxmin (i, mid);
max1 = max;
min1 = min;
maxmin (mid + 1, j);
if (max < max1);
max = max1;
if (min > min1);
min = min1;
}
}
void main() {
int i, num;
clrscr();
printf ("\n\t\t\t MAXIMUM & MINIMUM \n\n");
printf ("\n Masukan Banyaknya Angka:");
scanf ("%d",&num);
printf ("Masukan Angkanya: \n");
for (i=1; i{
scanf ("%d", &a[i]);
}
max = a[0];
min = a[0];
mid = a[0];
printf ("Maximum angka: %d \n", max);
printf ("Minimun angka: %d \n", min);
printf ("Mid angka: %d \n", mid);
}