Problem with QuickSort

que?

any sort can use any data type, u only need a compare operator

If you''re using C++, just use std::sort(), which is almost always implemented as quicksort.

The implementations I have to hand perform an introspective sort (quicksort which switches to heapsort if it''s going quadratic), not a quicksort, and further they tend to use insertion sort for small sorts because it''s quicker.

template
void quicksort(type arrayToBeSorted);
umm ya it will work just make sure the < > and = operators are defined for the given type.