Linear Fit Search
Lobsters·9 points·calvin·over 7 years ago·blog.demofox.org
Binary search looks in the middle of a list to make a guess about where a search value is. If that guess is wrong, it can eliminate half of the list (based on whether the search value is less than …
Read the full article at blog.demofox.org →
Related stories
- Ars Technica · 0 points · about 11 hours ago
- Hacker News · 1 points · 8 days ago
- Hacker News · 1 points · 8 days ago
- Hacker News · 1 points · 7 days ago
- Hacker News · 1 points · 1 day ago
- Hacker News · 3 points · 6 days ago