- Time complexity:
- Best: Ω(n log(n))
- Average: Θ(n log(n))
- Worst: O(n log(n))
- Space complexity:
- Using arrays: O(n)
- Using linked lists (and Recusion): O(log(n))
- Not in-place
- Stable
NelsonBN/algorithms-data-structures-merge-sort
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|