Which sorting algorithm is fastest?

Which sorting algorithm is fastest?
Merge Sort is the fastest stable sorting algorithm with worst-case complexity of O(nlogn), but it requires extra space. Although, if memory constraints are very tight you can use Quick Sort, whose worst-time compelxity is O(n^{2}) but average case complexity is O(nlogn).

Reference:
Fastest sorting algorithm . - general - CodeChef Discuss
Aug 5, 2019

Which sorting algorithm is fastest?,frequently asked question,question and answer,answer,