A merge sort is an efficient sorting algorithm that recursively splits a list into two similarly sized lists (left and right), sorts each list, and merges the result.
🔔 Complexity is considered in terms of worst case.
| Notes | |
|---|---|
| Θ(n log n) |
| Notes | |
|---|---|
| Θ(n) | In this implementation two temporary lists are created and merged recursively |