Question

What is the fastest way to sort a series of numbers? ​

Answer 1

by grouping the no

• when can do ot

Answer 2

merge sort is the fastest way to sort a series of a numbers.Merge Sort is the fastest stable sorting algorithmwith 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).