- 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
-
Notifications
You must be signed in to change notification settings - Fork 0
Algorithms and Data Structures - Merge Sort
License
NelsonBN/algorithms-data-structures-merge-sort
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Algorithms and Data Structures - Merge Sort