Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Binary search with confidence. Parent comment
It also reminds me a little bit of exponential search (upper bound unknown), although obviously the upper bound is known in your implementation.
Bisection: https://en.wikipedia.org/wiki/Bisection_method Exponential search: https://en.wikipedia.org/wiki/Exponential_search
A practical application of bisection search is in git bisect (https://git-scm.com/docs/git-bisect) to find the first revision that introduced a bug.
There are no comments on this comment yet.
It also reminds me a little bit of exponential search (upper bound unknown), although obviously the upper bound is known in your implementation.
Bisection: https://en.wikipedia.org/wiki/Bisection_method Exponential search: https://en.wikipedia.org/wiki/Exponential_search
A practical application of bisection search is in git bisect (https://git-scm.com/docs/git-bisect) to find the first revision that introduced a bug.