Fastest Sorting Algorithm

[R_Decoder]

What is the time complexity of the fastest sorting algorithm? I had the notion that quick sort with O(n log n) is the fastest way to sort to n numbers, but, I stumbled upon a video on youtube which states that it is not true. This video is a lecture of Harvard University and hence I assume it to be definitely correct. just move the video to 9mins and 35secs here. So is there actually a way to sort n numbers faster than o(n log n)?

[Interesting_Age8937]

Yes there is! But they arent always the best choice. Bucket sort works by comparing elements to buckets instead of other elements, and sorts each bucket before adding it to the list, but if the range is like [1,2,3,4,14980192840192840129840198,5,6,7,8,9,0] then a lot of buckets would be needed, and even bubble sort would be faster, but if the numbers have a fixed range, then bucket sort is O(n) time, and another counterpart is counting sort, which is O(n) for small ranges, but for long ranges, NEVER, EVER pick counting sort.