Added space complexity

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

Author: IAteNoodles

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) due to the temporary arrays created during the merging process.
 
     Examples:
     >>> merge_sort([0, 5, 3, 2, 2])