How do merge sort and quick sort compare?

How do merge sort and quick sort compare in terms of efficiency?

Merge sort has a time complexity of O(n log n) in all cases, while quick sort has an average time complexity of O(n log n) but can degrade to O(n^2) in the worst case.

What are the main differences in their algorithms?

Merge sort is a divide-and-conquer algorithm that divides the array into halves, sorts them, and merges them back. Quick sort also divides the array but selects a 'pivot' to partition the elements.

Which one is better for large datasets?

Merge sort is generally more stable and performs better on large datasets, especially when dealing with linked lists, while quick sort is often faster in practice for arrays.

Are there any scenarios where quick sort is preferred?

Yes, quick sort is preferred when memory usage is a concern, as it sorts in place and has lower overhead compared to merge sort.