8000 Update LinkedList time complexity for deletion. · m1nd/javascript-algorithms@2371dd2 · GitHub
[go: up one dir, main page]
Skip to content

Commit 2371dd2

Browse files
trekhlebtrekhleb
committed
Update LinkedList time complexity for deletion.
1 parent a1d218d commit 2371dd2

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

‎README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -279,7 +279,7 @@ Below is the list of some of the most used Big O notations and their performance
279279
| **Array** | 1 | n | n | n | |
280280
| **Stack** | n | n | 1 | 1 | |
281281
| **Queue** | n | n | 1 | 1 | |
282-
| **Linked List** | n | n | 1 | 1 | |
282+
| **Linked List** | n | n | 1 | n | |
283283
| **Hash Table** | - | n | n | n | In case of perfect hash function costs would be O(1) |
284284
| **Binary Search Tree** | n | n | n | n | In case of balanced tree costs would be O(log(n)) |
285285
| **B-Tree** | log(n) | log(n) | log(n) | log(n) | |

0 commit comments

Comments
 (0)
0