分治法求数组的最大值最小值

实现求数组的最大值最小值，蛮力法要容易的多。本着重在体验分治法的思想的原则：

 

int main(void)
{
    void Maxmin(int a[],int low,int high,int maxmin[2]);
    int a[10],maxmin[2];

    printf("Enter 10 integer numbers:\n");
    for(int i=0;i<10;i++)
        scanf("%d",a+i);

    Maxmin(a,0,9,maxmin);
    printf("\nMaximum: %d\nMinimum: %d\n",maxmin[0],maxmin[1]);
    system("pause");
    return 1;
}

// 分治法求数组的最大值和最小值
void Maxmin(int a[],int low,int high,int maxmin[2])
{
    int mid;
    int maxmin1[2],maxmin2[2];

    if (high==low)
    {
        maxmin[0]=a[low];
        maxmin[1]=a[low];
        return;
    }
    if (high==low+1)
    {
        if(a[high]>a[low])
        {
            maxmin[0]=a[high];
            maxmin[1]=a[low];
        }else
        {
            maxmin[0]=a[low];
            maxmin[1]=a[high];
        }
        return;
    }
    else
    {
        mid = (high+low)/2;
        Maxmin(a,low,mid,maxmin1);
        Maxmin(a,mid+1,high,maxmin2);
        if(maxmin1[0]>maxmin2[0])
            maxmin[0]=maxmin1[0];
        else 
            maxmin[0]=maxmin2[0];
        // minimum
        if(maxmin1[1]<maxmin2[1])
            maxmin[1]=maxmin1[1];
        else 
            maxmin[1]=maxmin2[1];
    }
}