Update main README.

This commit is contained in:
Oleksii Trekhleb
2018-06-30 20:11:20 +03:00
parent 41a6430532
commit 9dbf1c9889

View File

@ -232,7 +232,7 @@ Below is the list of some of the most used Big O notations and their performance
| **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) | |
| **Bloom Filter** | | 1 | 1 | | | | **Bloom Filter** | - | 1 | 1 | - | |
### Array Sorting Algorithms Complexity ### Array Sorting Algorithms Complexity