public static void quicksort(String terms[], int freqs[], int left, int right)
	{
		if (left == right)
			return;
		
		int loopLeft = left;
		int loopRight = right;
		int pivotIndex;
		int mid = (left + right) / 2;
		
		while(true)
		{
			pivotIndex = partition(terms, freqs, loopLeft, loopRight, mid);
			if (pivotIndex == mid)
				break;
			else if (mid < pivotIndex)
				loopRight = pivotIndex - 1;
			else
				loopLeft = pivotIndex + 1;
		}
		
		if (left < pivotIndex)
			quicksort(terms, freqs, left, pivotIndex - 1);
		if (right > pivotIndex)
			quicksort(terms, freqs, pivotIndex + 1, right);
	}