快速排序法C实现

#include <stdio.h>

/**
 * @brief 快速排序法
 * @param  arr  待排序的数组
 * @param  left  本次排序的数组最小下标
 * @param right  本次排序的数组最大下标
 * @return 无
 */
void quick_sort(int arr[], int left, int right)
{
    if (left < right) {
        int low = left, high = right, key = arr[left];
        while (low < high) {
            while (low < high && arr[high] >= key)
                high--;
            arr[low] = arr[high];
            while (low < high && arr[low] <= key)
                low++;
            arr[high] = arr[low];
        }
        arr[low] = key;
        quick_sort(arr, left,  low-1);
        quick_sort(arr, low+1, right);
    }
}

int main(int argc, char **argv)
{
    int arr[10] = {2,9,13,52,8,14,6,22,55,41};
    int i;
    for (i=0; i<10; i++)
        printf("%d ", arr[i]);
    printf("\n");
    quick_sort(arr, 0, 9);
    for (i=0; i<10; i++)
        printf("%d ", arr[i]);
    printf("\n");

    return 0;
}