快速排序

/*快速排序*/
#include<stdio.h>
#include<stdlib.h>

typedef struct
{
    int *data;
    int length;
}Sqlist;


/*顺序表的初始化*/
void InitList(Sqlist &L, int l)
{
    L.data = (int*)malloc((l+1)*sizeof(int));
    L.length = 0;
}

void CreateLList(Sqlist &L, int *a, int l)
{
    L.length = 1;
    for(int i=1; i<=l; i++)
    {
        L.data[i] = a[i-1];
        L.length++;
    }
}

/*将序列进行分块*/
int Partition(Sqlist &L, int low, int high)
{
    L.data[0] = L.data[low];
    while(low<high)
    {
        while(low < high && L.data[high] > L.data[0])
        {

            high--;
        }

        L.data[low] = L.data[high];
        while(low < high && L.data[low]<=L.data[0])
        {
            low++;
        }
        L.data[high] = L.data[low];
    }

    L.data[low] = L.data[0];
    return low;
}


/*递归思想对序列进行排序*/
int QSort(Sqlist &L, int low, int high)
{
    if (low<high)
    {
        int pivotloc =    Partition(L,low,high);
        QSort(L,low,pivotloc-1);
        QSort(L,pivotloc+1,high);
    }
}

void QuickSort(Sqlist &L)
{
    QSort(L,1,L.length-1);
}

void DisplayList(Sqlist L)
{
    for(int i = 1; i<L.length; i++)
    {
        printf("%d ",L.data[i]);
    }

    printf("
");
}

int main(int argc, char const *argv[])
{
    Sqlist L;
    int a[] = {27,13,76,97,65,38,49};
    int l = sizeof(a)/sizeof(a[1]);

    InitList(L,l);
    CreateLList(L,a,l);
    QuickSort(L);
    DisplayList(L);
    return 0;
}