From 1e0d3173fa4566bc03fbc207168225d948153bb6 Mon Sep 17 00:00:00 2001 From: Abhijit Kumar Singh Date: Sat, 30 Aug 2025 06:07:13 +0530 Subject: [PATCH] Specify space complexity for merge sort (#11749) * 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 --- sorts/merge_sort.py | 1 + 1 file changed, 1 insertion(+) diff --git a/sorts/merge_sort.py b/sorts/merge_sort.py index 0628b848b..11c202788 100644 --- a/sorts/merge_sort.py +++ b/sorts/merge_sort.py @@ -18,6 +18,7 @@ def merge_sort(collection: list) -> list: :return: The same collection ordered in ascending order. Time Complexity: O(n log n) + Space Complexity: O(n) Examples: >>> merge_sort([0, 5, 3, 2, 2])