Skip to content
#

compettiveprogramming

Here are 6 public repositories matching this topic...

Language: All
Filter by language
search-bounds-verified

Is binary search's O(log N) worst case actually optimal? Only under specific assumptions. This repo tests where they break: interpolation search, entropy-optimal search, Knuth's DP-optimal BST, and search under an unreliable oracle -- checked against information-theoretic bounds with Monte Carlo simulation and sanitized tests. Nine real bugs found

  • Updated Sep 12, 2026
  • C++

Add this topic to your repo

To associate your repository with the compettiveprogramming topic, visit your repo's landing page and select "manage topics."

Learn more