You can beat the binary search
signa11
21 points
2 comments
April 30, 2026
Related Discussions
Found 5 related stories in 80.1ms across 8,303 title embeddings via pgvector HNSW
- Binary GCD tosh · 82 pts · April 19, 2026 · 49% similar
- The future of code search is not regex – 100x faster than ripgrep neogoose · 14 pts · April 02, 2026 · 44% similar
- Show HN: IResearch – C++ search that beat Lucene and Tantivy on their benchmark gnusi · 13 pts · May 20, 2026 · 44% similar
- SereneDB's C++ search engine is the fastest on search benchmarks gnusi · 31 pts · March 19, 2026 · 43% similar
- Yes, all longest regex matches in linear time is possible g0xA52A2A · 15 pts · March 17, 2026 · 40% similar
Discussion Highlights (2 comments)
srean
Another interesting case to analyze would be where the array is 2d and values increase to the right and upwards.
tnelsond4
https://www.p99conf.io/session/40x-faster-binary-search/ How's that compare to this?