hxx/javascript-algorithms
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git synced 2024-12-27 15:41:16 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add comments to data-structure complexity table.

Browse Source
This commit is contained in:
Oleksii Trekhleb 2018-05-25 07:28:08 +03:00
parent f696d028ba
commit 7bd7f9a283
1 changed files with 11 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
README.md
View File

@ -199,17 +199,17 @@ Below is the list of some of the most used Big O notations and their performance
### Data Structure Operations Complexity ### Data Structure Operations Complexity
| Data Structure | Access | Search | Insertion | Deletion | | Data Structure | Access | Search | Insertion | Deletion | Comments |
| ----------------------- | :-------: | :-------: | :-------: | :-------: | | ----------------------- | :-------: | :-------: | :-------: | :-------: | :-------- |
| **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 | 1 | |
| **Hash Table** | - | n | n | n | | **Hash Table** | - | n | n | n | In case of perfect hash function costs would be O(1) |
| **Binary Search Tree** | n | n | n | n | | **Binary Search Tree** | n | n | n | n | |
| **B-Tree** | log(n) | log(n) | log(n) | log(n) | | **B-Tree** | log(n) | log(n) | log(n) | log(n) | |
| **Red-Black Tree** | log(n) | log(n) | log(n) | log(n) | | **Red-Black Tree** | log(n) | log(n) | log(n) | log(n) | |
| **AVL Tree** | log(n) | log(n) | log(n) | log(n) | | **AVL Tree** | log(n) | log(n) | log(n) | log(n) | |
### Array Sorting Algorithms Complexity ### Array Sorting Algorithms Complexity