Merge sort vs quick sort for array

Question

Hi

Can any one share thought why one should go for merge sort over quick sort in case of larger array size ?

Both are having n log n... How length of array metter for choice?

Answer 1

Quicksort has a worst case O(N²) complexity.
Mergesort has a worst case O(NlogN) complexity.

Which method is better depends on many things though.

Answer 2

https://www.geeksforgeeks.org/quick-sort-vs-merge-sort/

This may help you

Answer 3

Ketan Lalcheta please can you show me some good references on your statement, "merge sort over quick sort in case of large arrays". I was also searching for something similar.

Answer 4

Ketan Lalcheta have a look at this: https://stackoverflow.com/questions/65562749/why-is-merge-sort-better-for-large-arrays-and-quick-sort-for-small-ones