快速排序

来源：互联网发布：香港购物知乎编辑：程序博客网时间：2024/04/30 21:07

#include <stdio.h>
#include <stdlib.h>

void QuickSort(int *array, int low, int high)
{
    if(low < high)
    {
        int _low = low;
        int _high = high + 1;
        int provit = array[low];

        int temp = 0;

        while (1)
        {
            while (array[++_low] < provit);
            while (array[--_high] > provit);

            if (_low >= _high)
            {
                break;
            }

            temp = array[_low];
            array[_low] = array[_high];
            array[_high] = temp;
        }

        array[low] = array[_high];
        array[_high] = provit;

        QuickSort(array, low, _high - 1);
        QuickSort(array, _high + 1, high);
    }

}

int main()
{
    int myArray[10] = {

        28, 231, 12, 42, 14, 1, 63, 85, 31, 0
    };

    for (int i = 0; i < 10; i++)
    {
        printf("%d ", myArray[i]);
    }
    printf("/n");

    QuickSort(myArray, 0, 9);

    for (int j = 0; j < 10; j++)
    {
        printf("%d ", myArray[j]);
    }

    return 0;
}