QSort

#include<stdio.h>
void swap(int *p, int *q);
int median3(int *array, int left, int right);
void qsort(int *array, int left, int right);

void main()
{
    int a[] = {2,3,1};
    //int array[] = {29, 7, 14, 20, 27, 11, 25, 0, 28, 26};
    int array[] = {23, 5, 6, 11, 29, 21, 8, 27, 8, 15};
    //int array[] = {0x7fff, 0x7fff, 0x7fff, 0x7fff, 0x7fff, 0x7fff, 0x7fff, 0x7fff, 0x7fff, 0x7fff};    
    int i;
    //printf("%d\n", a[median3(a, 0, 2)]);
    //swap(&a[0], &a[1]);
    //printf("%d %d\n", a[0],a[1]);
    qsort(array, 0, 9);
    for(i=0; i<10; i++)
        printf("%d ", array[i]);
}


void qsort(int *array, int left, int right)
{
    int low = left+1;
    int high = right;
    int pivot;
    
    if(right-left <=0)
        return;
    
    swap(&array[left], &array[median3(array, left, right)]);
    pivot = array[left];
    //printf("\n*%d*\n", pivot);
    while(1)
    {
        while((low < high) && (array[low] <= pivot))
        {
            printf("$: %d\n", array[low] );
            low++;
        }    
        while(array[high] > pivot)
            high--;
        if(low<high)
        {
            swap(&array[low], &array[high]);
            low++;
            high--;
        }
        else
            break;
    }
    swap(&array[high], &array[left]);
    qsort(array, left, high-1);
    qsort(array, high+1, right);
}

int median3(int *array, int left, int right)
{
    int mid = (left + right)/2;
    
    if(array[left] < array[mid])
        if(array[mid] < array[right])
            return mid;
        else 
            return array[left]>array[right] ? left : right;
    else 
        if(array[mid] > array[right])
            return mid;
        else 
            return array[left]<array[right] ? left : right;
}

void swap(int *p, int *q)
{
    int temp;
    temp = *p;
    *p = *q;
    *q = temp;
}