News for hackers. Stuff that matters.
Re:Binary Search: A new implementation that is up to 25% faster by rurban on Monday July 20, 2020 @12:59PM (#23899705)
You search the strings wordwide then, by 8 not by 1. You just need to represent the strings little or big endian, and construct the nested switches offline. About 20x faster than linear search via memcmp. http://blogs.perl.org/users/rurban/2014/08/perfect-hashes-an...

There are no comments on this comment yet.