Does there exist a sorting algorithm with average time complexity better than O(n * log(n)) on a list of integers?