Space Complexity

How much extra memory an algorithm needs as $n$ grows.

Easy

Merge sort uses $O(n)$ extra; heap sort $O(1)$ . Recursion uses stack space proportional to its depth.

Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.

Discussion (0)