Which stable divide-and-conquer sorting algorithm recursively divides an input into halves, sorts each half, and then combines the two sorted halves?

Show answer

Merge Sort

Invented by John von Neumann in 1945, Merge Sort is a classic example of the divide-and-conquer strategy that guarantees a consistent O(n log n) runtime. Because it is a stable sort, it ensures that items with the same value maintain their original relative order. Think of it as a 'split and stitch' method that breaks a list down to single elements before weaving them back together in perfect order.

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

Which stable, in-place sorting algorithm with a worst-case complexity of O(n^2) works by repeatedly taking the next element and placing it into its correct position among the already-sorted elements?
Which stable sorting algorithm is commonly used as a subroutine in Radix Sort to sort digits?
Which string-matching algorithm uses a 'prefix function' (or failure function) to avoid redundant comparisons?
Which string-matching algorithm uses hashing to find any one of a set of pattern strings in a text?
Which theorem provides a standardized way to solve recurrence relations of the form T(n) = aT(n/b) + f(n)?
While the 0/1 Knapsack problem is typically solved using dynamic programming, which algorithmic approach provides an optimal solution for the Fractional Knapsack problem?

See all 83 →