hxx/javascript-algorithms
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git synced 2024-11-13 06:23:00 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update LinkedList time complexity for deletion.

Browse Source
This commit is contained in:
Oleksii Trekhleb 2019-03-08 13:13:21 +02:00
parent a1d218dd29
commit 2371dd28d3
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
README.md
View File

@ -279,7 +279,7 @@ Below is the list of some of the most used Big O notations and their performance
| **Array** | 1 | n | n | n | | | **Array** | 1 | n | n | n | |
| **Stack** | n | n | 1 | 1 | | | **Stack** | n | n | 1 | 1 | |
| **Queue** | n | n | 1 | 1 | | | **Queue** | n | n | 1 | 1 | |
| **Linked List** | n | n | 1 | 1 | | | **Linked List** | n | n | 1 | n | |
| **Hash Table** | - | n | n | n | In case of perfect hash function costs would be O(1) | | **Hash Table** | - | n | n | n | In case of perfect hash function costs would be O(1) |
| **Binary Search Tree** | n | n | n | n | In case of balanced tree costs would be O(log(n)) | | **Binary Search Tree** | n | n | n | n | In case of balanced tree costs would be O(log(n)) |
| **B-Tree** | log(n) | log(n) | log(n) | log(n) | | | **B-Tree** | log(n) | log(n) | log(n) | log(n) | |