Question 1

What is the time complexity of merge sort and quick sort?

Accepted Answer

Merge sort has a time complexity of O(n log n) in all cases. Quick sort has an average time complexity of O(n log n), but its worst-case time complexity is O(n^2).

Question 2

When would you use a stable sorting algorithm?

Accepted Answer

A stable sorting algorithm is used when you need to preserve the relative order of equal elements. This is important in applications where you sort the same data by different keys.

Sorting Algorithms Interview Questions

Related Algorithm Guides