排序算法（六）快速排序的优化

//优化方法一、分别取第一个数字，中间数字，和最后一个数字进行比较，选择中间的数字作为基准
//三者取中只能优化数据基本有序的情况，包含降序和升序
static int Mid(int a,int b,int c)
{
    int tmp;
    //将三个数字从小到大有序
    if(a > b)
    {
        tmp = a;
        a = b;
        b = tmp;
    }
    if(a > c)
    {
        tmp = a;
        a = c;
        c = tmp;
    }
    if(b > c)
    {
        tmp = b;
        b = c;
        c = tmp;
    }

    return b;//b则是中间大的数字
}
//三者取中得到基准
static int GetPivot(int *arr,int low,int high)

    int mid = (low+high)/2;
    int piv = Mid(arr[low],arr[mid],arr[high]);//基准值
    int tmp;

    //将基准值交换到low下标
    //if(piv == arr[low])//不需要交换
    if(piv == arr[mid])
    {
        tmp = arr[low];
        arr[low] = arr[mid];
        arr[mid] = tmp;
    }
 不能 else if(piv == arr[high])
    {
        tmp = arr[low];
        arr[low] = arr[high];
        arr[high] = tmp;
    }

    return piv;
}

//三者取中，优化基准
int Partition(int *arr,int low,int high)//O(n),O(1)
{
    int tmp = GetPivot(arr,low,high);

    while(low < high)
    {
        while(low<high && arr[high]>=tmp)//从后往前找比基准小的数据
        {
            high--;
        }
        if(low == high)
        {
            break;
        }
        else
        {
            arr[low] = arr[high];//************
        }

        while(low<high && arr[low]<=tmp)//从前往后找比基准大的数字
        {
            low++;
        }
        if(arr[low] > tmp)
        {
            arr[high] = arr[low];//***********
        }
        else
        {
            break;
        }
    }

    arr[low] = tmp;

    return low;
}


//优化方法二
//选择第一个作为基准，但是在移动low和high的同时进行冒泡
static int Partition2(int *arr,int low,int high)
{
    int piv = arr[low];//基准值
    int tmp;//交换数据时使用
    int start = low;
    int end = high;

    while(low < high)
    {
        while(low<high && arr[high]>=piv)//从后往前找比基准小的数据
        {
            if(high<end && arr[high]>arr[high+1])
            {
                tmp = arr[high];
                arr[high] = arr[high+1];
                arr[high+1] = tmp;
            }
            high--;
        }
        if(low == high)
        {
            break;
        }
        else
        {
            arr[low] = arr[high];
        }

        while(low<high && arr[low]<=piv)//从前往后找比基准大的数字
        {
            if(low>start && arr[low-1]>arr[low])
            {
                tmp = arr[low-1];
                arr[low-1] = arr[low];
                arr[low] = tmp;
            }
            low++;
        }
        if(arr[low] > piv)
        {
            arr[high] = arr[low];
        }
        else
        {
            break;
        }
    }

    arr[low] = piv;

    return low;
}