From fee70138bf5347d3d0ca6ba97de2eab5e3957559 Mon Sep 17 00:00:00 2001
From: Shyam Makwana <makwanashyam6@gmail.com>
Date: Wed, 8 May 2024 17:10:29 -0400
Subject: [PATCH] Merge Sort Space Complexity is O(n)

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 24f22af..3b76b2f 100644
--- a/README.md
+++ b/README.md
@@ -354,7 +354,7 @@ This algorithm never needed to compare all the differences to one another, savin
 - Best Case: `O(n)`
 
 #### Space Complexity
-- Worst Case: `O(1)`
+- Worst Case: `O(n)`
 
 #### Visualization
 ![#](https://upload.wikimedia.org/wikipedia/commons/thumb/e/e6/Merge_sort_algorithm_diagram.svg/400px-Merge_sort_algorithm_diagram.svg.png)