As merge sort and quicksort both have the same average time complexity of $O(n \log(n))$. In which scenarios would merge sort be preferred over quicksort when sorting data?
$\begingroup$
$\endgroup$
-
$\begingroup$ This question can help you. $\endgroup$ – Marcelo Fornet Dec 7 '17 at 15:25
