How to find words by their prefix, which can be mistyped, and sort them by frequency stored with the word. 7 years ago

Comments

Frank Earnest:

I'm not interested in doing artificial benchmarks on a whim, I just wanted to point out the insanity of this statement: "The table will be smaller, but you will have a branch (if statement) in your code, so it will be slower... 7 months ago

Peter Kankowski:

Frank, please feel free to do a benchmark 7 months ago

Frank Earnest:

That was supposed to be "branch [mis]prediction bad". 7 months ago

Frank Earnest:

> It's a noticeable difference for modern processors with branch prediction. Most of the branches in a binary search loop *are* predictable though... 7 months ago

Peter Kankowski: