An Interest In:
Web News this Week
- April 19, 2024
- April 18, 2024
- April 17, 2024
- April 16, 2024
- April 15, 2024
- April 14, 2024
- April 13, 2024
Some of Our Sources
- BoingBoing
- Techcrunch
- The Logo Smith
- Inspiredology
- Stylized Web
- Wal You
- Freelance Switch
- Android Headlines
- Willems Lab
- The Verge
Help Webnuz
Referal links:
August 1, 2020 03:34 pm
Original Link: http://rss.slashdot.org/~r/Slashdot/slashdot/~3/mDYwA51Ovo4/is-it-possible-to-implement-faster-binary-searches
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.Read more of this story at Slashdot.
Original Link: http://rss.slashdot.org/~r/Slashdot/slashdot/~3/mDYwA51Ovo4/is-it-possible-to-implement-faster-binary-searches
Share this article:
Tweet
View Full Article
Slashdot
Slashdot was originally created in September of 1997 by Rob "CmdrTaco" Malda. Today it is owned by Geeknet, Inc..More About this Source Visit Slashdot