From 8db8f5b24bd1bc7b0a2280852d964f0d79b8a21d Mon Sep 17 00:00:00 2001
From: NoodlesIAte <90202919+IAteNoodles@users.noreply.github.com>
Date: Fri, 4 Oct 2024 10:06:58 +0530
Subject: [PATCH] Added complexities

---
 sorts/quick_sort.py | 9 +++++++++
 1 file changed, 9 insertions(+)

diff --git a/sorts/quick_sort.py b/sorts/quick_sort.py
index 374d52e75..15102752d 100644
--- a/sorts/quick_sort.py
+++ b/sorts/quick_sort.py
@@ -26,6 +26,15 @@ def quick_sort(collection: list) -> list:
     []
     >>> quick_sort([-2, 5, 0, -45])
     [-45, -2, 0, 5]
+
+    Time Complexity:
+    Best Case: O(n log n)
+    Average case: O(n log n)
+    Worst Case: O(n^2)
+
+    Space Complexity:
+    Best Case: O(log n)
+    Worst Case: O(n)
     """
     # Base case: if the collection has 0 or 1 elements, it is already sorted
     if len(collection) < 2: