// Attempting to create a generic quicksort when I haven't even looked at Java in 3.5 years...
	private <T extends Comparable<T>> void quicksort(T[] A, int lo, int hi) {
		if (lo < hi) {
			int p = partition(A, lo, hi);
			quicksort(A, lo, p - 1);
			quicksort(A, p + 1, hi);
		}
	}

	private static <T extends Comparable<T>> int partition(T[] A, int lo, int hi) {
		T pivot = A[hi];
		int i = lo - 1;
		for (int j = 0; j < hi; j++) {
			if (A[j].compareTo(pivot) < 0) {
				i++;
				T temp = A[i];
				A[i] = A[j];
				A[j] = temp;

			}
		}
		return 0;
	}

	// How do you use a string?!
	private boolean palindromePermutation(String in) {
		this.<Integer>quicksort((Integer[])(in.toCharArray()), 0, in.length());

		return true;
	}