《算法导论》中快速排序的实现

根据《算法导论》中快速排序的描述实现代码。

（已测试）

/*
 * =====================================================================================
 *
 * Filename: qsort.c
 *
 * Description:
 *
 * Version: 1.0
 * Created: 12/17/2012 09:06:10 PM
 * Revision: none
 * Compiler: gcc
 *
 * Author: [e-mail] (),
 * Organization:
 *
 * =====================================================================================
 */
#include <stdlib.h>
#include <stdio.h>
#define swap(a,b) {if(a!=b){(a)^=(b); (b)^=(a); (a)^=(b);}}
//#define swap(a, b) a^=b^=a^=b
//#define swap(A,B) A^=B;B^=A;A^=B

int partition(int input[], int start, int end){

    int low, high;
    low = start-1;
    high = start;
    int piv = input[end];
    for(;high<end;high++){
        if(input[high]<=piv){
            low++;
            swap(input[low],input[high]);
        }
    }
    low++;
    swap(input[low],input[end]);
    return low;
}
void qsortt(int input[], int start, int end){
    if(start<end){
        int mid = partition(input,start,end);
        qsortt(input,start,mid-1);
        qsortt(input,mid+1,end);
    }
}

int main(){
    int input[] = {3,2,5,6,1};
    qsortt(input, 0, 4);
    int i = 0;
    for(;i<sizeof(input)/sizeof(int);i++){
        printf("%d ",input[i]);
    }
    return 1;
}