TheAlgorithms/Python
1
0
Fork 0
Code Issues Pull Requests Actions 2 Packages Projects Releases Wiki Activity

Specify space complexity for merge sort (#11749)

Browse Source 
* Added space complexity

Space complexity of merge sort is a key factor, when compared to quick sort

* Update merge_sort.py

---------

Co-authored-by: Maxim Smolskiy <mithridatus@mail.ru>
This commit is contained in:
Abhijit Kumar Singh
2025-08-30 06:07:13 +05:30
committed by GitHub
parent c5de3954cc
commit 1e0d3173fa
1 changed files with 1 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
sorts/merge_sort.py
View File

@@ -18,6 +18,7 @@ def merge_sort(collection: list) -> list:
:return: The same collection ordered in ascending order. :return: The same collection ordered in ascending order.
Time Complexity: O(n log n) Time Complexity: O(n log n)
Space Complexity: O(n)
Examples: Examples:
>>> merge_sort([0, 5, 3, 2, 2]) >>> merge_sort([0, 5, 3, 2, 2])