Can you name algorithms with asymptotic complexity better than quicksort?

Quick sort on average runs in O(n log n), which is the optimal asymptotic for comparison algorithms. However, there are algorithms with better asymptotic complexity in some cases:

• Counting Sort — O(n + k), where k is the range of values. Works faster if k is not too large.
• Radix Sort — O(d * (n + k)), where d is the number of digits, k is the base of the number system. Efficient for sorting numbers or strings.
• Merge Sort — guaranteed O(n log n), stable and predictable.

Important: algorithms with better than O(n log n) complexity are not based on comparing elements, but use additional assumptions about the data (for example, limited range of values).