Articles by tag: binary-search

Number search algorithms: from Knuth to MCMC

Breakdown of number guessing strategies in [1,N]: Knuth's maximin O(N²), random O(log N), Metropolis-Hastings MCMC. Code, analysis, benchmarks. Choose the optimal for your N.

Search Algorithms O(log n) vs O(n) in Python

Breakdown of linear, binary, exponential search and hash tables. Code, complexity, selection checklist. For middle/senior developers. Benchmarks and LeetCode examples.