Counting Sort 1 Comparison Sorting Quicksort usually has a running time of nnn x log(n)log(n)log(n), but is there an algorithm that can sort even faster? In general, this is not possible. Most sorting algorithms are comparison sorts, i.e. they sort a list just by comparing the elements to one another. A comparison sort algorithm cannot beat nnn x log(n)log(n)log(n) (worst-case) running time, sin..