C语言的快速排序

2分快速排序

C代码：

typedef unsigned char BYTE;

void swap(BYTE *a, BYTE *b)
{
    if(a != b) {
        *a = *a ^ *b;
        *b = *b ^ *a;
        *a = *a ^ *b;
    }
}

/***
 *2路划分快速排序
 *
 **/
int partition(BYTE *array, int left, int right)
{
    int i = left - 1, j = right;
    BYTE v = array[right];
    while(1) {
        while(array[++i] < v);
        while(array[--j] > v)
            if(j == 1)
                break;
        if(i >= j)
            break;
        printf("i = %d, j = %d\n", i, j);
        swap(&array[i], &array[j]);
    }
    swap(&array[i], &array[right]);
    printf("i = %d, right = %d\n", i, right);

    return i;
}

void quicksort(BYTE *array, int left, int right)
{
    if(left < right) {
        int i = partition(array, left, right);
        quicksort(array, left, i - 1);
        quicksort(array, i + 1, right);
    }
}