分治法求最大数最小数

#include <stdio.h>
/*
 * 任意十个数，打印出它们中的最大数、最小数
 *
 * 测试数据：①  1,-12,20,30,-5,-23,33,125,200,-100
              ②  0,10,3,1,5,6,-10,90,9,-4
              ③  12,13,14,15,10,-10,-11,-12,-9,9
    思路：用分治法的思想做
 * */
#define ARRY_SIZE 10

void GetMaxAndMin(int *pArr, int l, int r, int *pMax, int *pMin);

int main()
{
    // 定义数组
    //int iArr[ARRY_SIZE] = {12,13,14,15,10,-10,-11,-12,-9,9};
    //int iArr[ARRY_SIZE] = {0,10,3,1,5,6,-10,90,9,-4};
   int iArr[ARRY_SIZE] = {1,-12,20,30,-5,-23,33,125,200,-100};
    int iMax, iMin;
    GetMaxAndMin(iArr, 0, ARRY_SIZE - 1, &iMax, &iMin);
    printf("The max value is %d
The min vlaue is %d
", iMax, iMin);
    return 0;
}

void GetMaxAndMin(int *pArr, int l, int r, int *pMax, int *pMin)
{
    if (l == r)
    {
        *pMax = pArr[l];
        *pMin = pArr[1];
        return;
    }
    else if(l + 1 == r)
    {
        if (pArr[l] >= pArr[r])
        {
            *pMax = pArr[l];
            *pMin = pArr[r];

        }
        else
        {
            *pMax = pArr[r];
            *pMin = pArr[l];
        }//else
        return;
    }
    int iMiddle = (l + r) / 2;  // 求中点
    int lMax;
    int lMin;
    GetMaxAndMin(pArr, l, iMiddle, &lMax, &lMin);
    int rMax;
    int rMin;
    GetMaxAndMin(pArr, iMiddle, r, &rMax, &rMin);
    *pMax = lMax > rMax ? lMax : rMax;
    *pMin = lMin > rMin ? rMin : lMin;


}