Merge Sort, explained

Divide and conquer, with the Python and the complexity side by side.

Prompt

Explain merge sort as a one-page reference card. Left column: a short description, how it works in four numbered steps, and time and space complexity. Right column: a clean Python implementation with line numbers and an example call.