C++: Merge Sort vs Quick Sort

What are the main differences between merge sort and quick sort in C++?

Merge sort is a stable, divide-and-conquer algorithm that has a time complexity of O(n log n), while quick sort is generally faster with an average time complexity of O(n log n) but can degrade to O(n^2) in the worst case.

When should I use merge sort instead of quick sort?

You should use merge sort when you need stable sorting or when dealing with linked lists, as it performs better in those scenarios.

Can you explain how quick sort works in C++?

Sure! Quick sort works by selecting a 'pivot' element and partitioning the array into two sub-arrays: elements less than the pivot and elements greater than the pivot, then recursively sorting the sub-arrays.

What are the space complexities of both algorithms?

Merge sort has a space complexity of O(n) due to the temporary arrays used for merging, while quick sort has a space complexity of O(log n) due to the recursive stack.