News for hackers. Stuff that matters.
Re:Fast function to parse strings into double (binary64) flo... by Dylan16807 on Wednesday March 11, 2020 @02:09AM (#22543466)
There are plenty of algorithms that are also O(logn) that are much faster in practice, because of how caches work.
Re:Fast function to parse strings into double (binary64) flo... by RossBencina on Wednesday March 11, 2020 @04:16AM (#22544064)
Could you name some please? I'm genuinely interested in learning of data structures with this property.
Re:Fast function to parse strings into double (binary64) flo... by Dylan16807 on Wednesday March 11, 2020 @05:39AM (#22544383)
The simplest one is a B tree. It's like a self-balancing binary tree, except that you put more than two children in each node.

Same big-O, but faster by a big linear multiplier.

Re:Fast function to parse strings into double (binary64) flo... by vardump on Wednesday March 11, 2020 @06:04AM (#22544497)
If the data is small enough (up to about n=100 magnitude), linear scan O(n) often beats asymptotically faster algorithms.