Can a randomized binary search have an \(O(1)\) complexity at least in practice? (Q2383711)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Can a randomized binary search have an \(O(1)\) complexity at least in practice? |
scientific article |
Statements
Can a randomized binary search have an \(O(1)\) complexity at least in practice? (English)
0 references
19 September 2007
0 references
randomized binary search
0 references
empirical \(O(1)\) complexity
0 references
