Update bloom filters description.

This commit is contained in:
Oleksii Trekhleb 2018-06-30 20:49:18 +03:00
parent a2310c59d3
commit b3fd5accda

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 | - | False positives are possible while searching |
### Array Sorting Algorithms Complexity ### Array Sorting Algorithms Complexity