4 ms·
Not O(log(searchable))?
by kapauldo 9y ago
Not O(log(searchable))?
- joshka 9y agoThis depends on your index function, and what operation you're optimizing for. My notation here was a shortcut for <insert explanation of differences to searching / filtering / sorting / etc. algorithm time complexity> where O(search) < O(scan), but by how much is implementation specific.