Hacker News new | ask | show | jobs
by marvy 4142 days ago
But there's an easy fix: don't pick numbers from the given sequence, instead use binary search on [0,n]. Then you're guaranteed only log n iterations.
1 comments

Hi, I was using pure functional programming style, so list only.