C语言学习13

快速排序

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

void quicksort(int a[], int left, int right);

void main()
{
    int a[10] = {99, 45, 12, 36, 69, 22, 62, 796, 4, 696};
    int i;
    printf("初始排序: 
");
    for(i = 0; i < 10; i++)
    {
        printf("    %d", a[i]);
    }
    quicksort(a, 0, 10);
    printf("
快速排序后的结果:
");
    for(i=0; i<10; i++)
    {
        printf("    %d", a[i]);
    }
    printf("
");
}

void quicksort(int a[], int left, int right)
{
    int j = left, k = right, temp, point;

    point = a[(left + right) / 2];

    while(j <= k)
    {
        while(a[j] < point)
        {
            j++;
        }
        while(a[k] > point)
        {
            k--;
        }
        if(j <= k)
        {
            temp = a[j];
            a[j] = a[k];
            a[k] = temp;
            j++;
            k--;
        }
    }
    if(left<k)
    {
        quicksort(a, left, k);
    }
    if(j<right)
    {
        quicksort(a, j, right);
    }
}