← Back to Algorithms

Merge Sort

Sort an array by dividing it into two halves, sorting them, and then merging the sorted halves.

Normal
Step 0 of 0
Time Complexity: O(N log N)
Space Complexity: O(N)

How it works

How it works: Divides the array into halves, sorts them, and merges them back together.