quickfuck

void quicksort(int *a, int l, int r)
{
	int begin = l, end = r;
	int pivot = (r-l)/2;
	int pVal = a[pivot];
	if(end-begin > 1)
	{
		while(l <= r)
		{
			while(a[l] < pVal)
				l++;

			while(a[r] > pVal)
				r--;

			if(l <= r)
			{
				int temp = a[l];
				a[l] = a[r];
				a[r] = temp;
				l++;
				r--;
			}
		}
		quicksort(a, begin, l);
		quicksort(a, l, end);
	}
}