Is It Possible to Implement Faster Binary Searches?
Last week Slashdot reader scandum described the search for the most efficient sorting algorithm. Now he's back, touting a new implementation for binary searches (using the same GitHub repo, and written in 15 to 30 lines of C code) that he says may be "up to 40%" faster for 32-bit integers. ("Keep in mind performance will vary depending on hardware and compiler optimizations.") The most commonly used binary search variant was first published by Hermann Bottenbruch in 1962 and hasn't notably changed since. Binary searches are one of the corner stones of computer science... The reason the algorithms are faster appears to be a combination of simpler calculations, branch prediction, and a reduction in cache misses.
from Slashdot https://ift.tt/2XigND8
Read more of this story at Slashdot.
from Slashdot https://ift.tt/2XigND8
Related Posts :
Study Finds More Than $100 Billion Spent on App Stores in 2020- Surprise Ending for Publishers: In 2020, Business Was Good
- VMware Sues Former Executive Who Left for CEO Job at Nutanix
- Global Digital-Tax Detente Ends, as US and France Exchange Blows
- McConnell Ties Full Repeal of Section 230 To Push for $2,000 Stimulus Checks
0 Response to "Is It Possible to Implement Faster Binary Searches?"
Post a Comment