《大话数据结构》读书笔记——9.9快速排序

#include "stdafx.h"
#include "stdlib.h"

int Partition(int *arr,int _low,int _high);
void QSort(int *arr,int low,int high);
void QuickSort(int *arr,int low,int high);
void Swap_a(int *arr,int i,int j);
int _tmain(int argc, _TCHAR* argv[])
{
    int arr[10] = {1,2,0,9,3,5,4,6,8,7};
    QuickSort(arr,0,9);

    for(int i=0;i<10;++i)
    {
        printf("%d\t",arr[i]);
    }
    system("pause");
    return 0;
}

int Partition(int *arr,int low,int high)
{
    int pivotkey;
    pivotkey = *(arr+low);
    while(low<high)
    {
        while(low<high && *(arr+high)>=pivotkey)
            high--;
        Swap_a(arr,low,high);
        while(low<high && *(arr+low)<=pivotkey)
            low++;
        Swap_a(arr,low,high);

    }
    return low;
}

void QSort(int *arr,int low,int high)
{
    int pivot;
    if (low<high)
    {
        pivot = Partition(arr,low,high);
        QSort(arr,low,pivot-1);
        QSort(arr,pivot+1,high);
    }
}
void QuickSort(int *arr,int low,int high)
{
    QSort(arr,low,high);
}

void Swap_a(int *arr,int i,int j)
{
    int tmp = *(arr+i);
    *(arr+i) = *(arr+j);
    *(arr+j) = tmp;
}