Is Merge Sort considered a stable sorting algorithm?

Show answer

Yes

Merge Sort is stable because it preserves the relative order of equal elements during the merge step, provided the implementation is careful to pick the element from the left subarray in the event of a tie.

Would you remember this in 6 months?

Trivia Forge uses spaced repetition so facts stick. Free, no signup needed.

Turn on Algorithms practice →

More Algorithms trivia

The Edmonds-Karp algorithm is a specific implementation of the Ford-Fulkerson method that uses which search strategy?
To perform a topological sort on a DAG, one can order the vertices in the reverse order of which DFS-calculated value?
What color must every leaf (NIL) be in a valid Red-Black Tree?
What fundamental tree operation is used by AVL trees and Red-Black trees to restore balance after an insertion or deletion?
What greedy selection criteria provides an optimal solution to the fractional knapsack problem?
What is the amortized time complexity of a 'Find-Set' operation when using both path compression and union-by-rank heuristics?

See all 83 →