#include <stdio.h>

int quicksort(int begin, int end, int a[], int len);

void main()

{

    int a[] = {, , , , , , , };

    int len = sizeof(a)/sizeof(int);

    int i=;

    int j=len-;

    int pivot;

    pivot = quicksort(i, j, a, len);

//printf("\npivot:%d\n", pivot);

    //for(i=0; i<len; i++)

    //{

    //    printf("%d ", a[i]);

    //}

}

int quicksort(int begin, int end, int a[], int len)

{

    int tmp = ;

    for(tmp=begin; tmp<=end; tmp++)

    {

        printf("%d ", a[tmp]);

    }

    printf("\n");

    int i=begin;

    int j = end;

    int key = a[i];

    //simple quick sort

    while(i<j)

    {

        while(a[j]>key && j>= && i<j)

        {

            j--;

        }

        if(j>= && i<j)

        {

            a[i] = a[j];

        }

        while(a[i]<key && i<len && i<j)

        {

            i++;

        }

        if(i<len && i<j)

        {

            a[j] = a[i];

        }

    }

    a[i] = key;

    int pivot = i;

    if(pivot > begin)

        quicksort(begin, pivot-, a, pivot-begin);

    if(pivot < end)

        quicksort(pivot+, end, a, end-pivot);

    return i;

}