I have always heard that usually merge sort is used for in built functions. But I cannot understand why. Quicksort is faster obviously with exact time complexity of 1.39NlogN and also it is in place! then why not quick sort?
Asked
Active
Viewed 115 times
-4
-
Check out: http://stackoverflow.com/questions/1517347/about-pythons-built-in-sort-method – Andrew_CS Aug 04 '15 at 17:50
-
1`Timsort` is used: https://en.wikipedia.org/wiki/Timsort, which is *easily* found by Googling – John Coleman Aug 04 '15 at 17:51