docs: add space complexity of Tim-sort

Chaedie · Chaedie · commit 41b208687e4f · 2024-12-10T07:56:00.000+09:00
diff --git a/top-k-frequent-elements/Chaedie.py b/top-k-frequent-elements/Chaedie.py
@@ -13,7 +13,8 @@
 
 Space Complexity: 
     1. dictionary for counting frequency of nums -> O(n)
-    2. sorted List -> O(n)
+    2. Timsort's space overhead -> O(n) 
+    3. sorted List -> O(n)
 
     Space complexity of this solution is O(n)
 """
