title: At which n does binary search become faster than linear search on a modern CPU?
body: <p>Due to the wonders of branch prediction, a binary search can be slower than a linear search through an array of integers. On a typical desktop processor, how big does that array have to get before it would be better to use a binary search? Assume the structure will be used for many lookups.</p>