QuickSort (recursive)

template <class T>
void QuickSort(T* a, const int left, const int right)
{
	int i, j, pivot;
	if(left < right)
	{
		i = left + 1;
		j = right;
		pivot = a[left];
		while(i < j)
		{
			while(a[i] < pivot)i++;
			while(a[j] > pivot)j--;
			if(i < j) swap(a[i], a[j]);
		}
		swap(a[left], a[j]);
		QuickSort(a, left, j - 1);
		QuickSort(a, j + 1, right);
	}
}