Tag Archives: quicksort

[C++] Counting sort: faster than quicksort!

Probably you know sorting at good level, written quicksort and other fast algorithms thousand times. The best sorting algorithms which as main operation has comparing one value to another has O(nlogn) complexity. With the assumption of comparing values they couldn’t … Continue reading

Leave a comment