← Divide & Conquer

Pattern Recognition Drill

#30 — Merge sort

Medium Sorting

The Problem

Sort an array using merge sort.

What approach would you use?

Think about it before scrolling down.

Key Signals

Divide & Conquer

Split array in half, recursively sort, merge sorted halves. O(n log n) time, O(n) space.

Common Trap

The merge step is where the work happens — two pointers picking the smaller element from each sorted half.

← #29 #31 →