What is the time complexity of the fastest sorting algorithm?

The time complexity of the fastest sorting algorithm is O(n log n), where n represents the number of elements being sorted.