Merge pull request tsiege#13 from BGZ30/master

Update Insertion Time Complextiy for Linked Lists
nandha46 · Dec 8, 2020 · 79250e8 · 79250e8
2 parents 4786a5c + 3f92c7a
commit 79250e8
Showing 1 changed file with 3 additions and 1 deletion.
diff --git a/README.md b/README.md
@@ -108,7 +108,9 @@ Big-Theta refers to the tight bound of time or space complexity of an algorithm.
 - Indexing:         Linked Lists: `O(n)`
 - Search:           Linked Lists: `O(n)`
 - Optimized Search: Linked Lists: `O(n)`
-- Insertion:        Linked Lists: `O(1)`
+- Append:           Linked Lists: `O(1)`
+- Prepend:          Linked Lists: `O(1)`
+- Insertion:        Linked Lists: `O(n)`
 
 
 ### <a id="hash"></a> Hash Table or Hash Map