quickSort

#include<stdio.h>

int partition(int a[], int low, int high){
	int key = a[low];
	int i = low;
	int j = high;
	
	while(i < j){
		while(i < j && a[j] >= key)
			j--;
		if(i < j){
			a[i] = a[j];
			i++;
		}
		while(i < j && a[i] < key)
			i++;
		if(i < j){
			a[j] = a[i];
			j--;
		}
	}
	
	a[i] = key;
	return i;
}

void quickSort(int a[], int low, int high){
	if(low < high){
		int pos = partition(a, low, high);
		quickSort(a, low, pos - 1);
		quickSort(a, pos + 1, high);
	}

}

int main(){
int a[] = {3, 4, 6, 9, 2, 6, 0};
int len = 7;
quickSort(a, 0, 6);

for(int i = 0; i < len; i++)
	printf("%d ", a[i]);
printf("\n");

return 0;
}