排序-快速排序算法

int base_quicksort(int A[], int first, int last){
    int temp = A[0];
    int i = 0;
    int j = sizeof(A[])/4 - 1;

    while(i != j){
        while(A[j] > temp)
            j--;
        A[i] = A[j];
        
        while(A[i+1] < temp)
            i++;
        A[j] = A[i+1];
        
        A[j] = temp;
        return j;
    }
}

void quicksort(int A[], int first, int last){
    if(first < last){
        int i = base_quicksort(A, first, last);
        
        quicksort(A, first, i-1);
        quicksort(A, i+1, last);
    }
    }