Merge Sort

Intermediate

Divide the array into halves, recursively sort each half, then merge the two sorted halves. Guaranteed O(n log n) in all cases.

time:O(n log n)

space:O(n)

⚡ +200_XP

step[1/27]

> Start

Starting array. Merge Sort will divide it into halves recursively, then merge sorted halves.

// tap NEXT STEP to walk through one step at a time