!!Con 2017: Interpolation Search Can Be Fast, in Some Situations, Sometimes, If You Try!
1,464 views · Published 18 May 2017 · 12:35 · Indexed 10 November 2026
Channel: Confreaks · 2017 · Science & Technology
Interpolation Search Can Be Fast, in Some Situations, Sometimes, If You Try! by Ruchir Khaitan When was the last time you binary searched a phone book? Never? What, you’ve never used a phone book? Okay, fine, I’ve never actually used a phone book for anything other than a doorstop either. But, if I had to search in one I would use interpolation search. It’s the ideal search algorithm / data structure for searching large arrays repeatedly. And with a little bit of operator-strength reducing math sorcery, it’s not just theoretically fast, it’s also useful in real life! Ruchir loves making computers go faster. He also loves eating, cooking and thinking about his next meal. He works on the Real Time Platform Team at AppNexus.
More from this channel
-
35:52
Code Design and the Science of Pleasure
-
48:58
Ruby Software Continuously Delivered and Exhaustively Explained by Brian Guthrie, Srushti Ambekallu
-
40:58
Jruby Polyglot Heaven by Thomas E Enebo and Charles Oliver Nutter
-
42:17
Be a Minecraft modman with Purugin by Thomas E. Enebo
-
36:46
Your tests are lying to you by Chris Parsons
-
23:46
KidsRuby: Think Of The Children! by Ron Evans
-
52:05
Resources, For Real This Time (with Webmachine) by Sean Cribbs
-
38:28
Just Say No To :nodoc: and Document Your Code! by Loren Segal