-4

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?

Meghdeep Ray
  • 5,262
  • 4
  • 34
  • 58
Shubham Aggarwal
  • 353
  • 2
  • 16

1 Answers1

1

timesort algo is used in the inbuilt sort

Archit Garg
  • 1,012
  • 8
  • 16