News for hackers. Stuff that matters.
Re:An interesting data structure with search time O(sqrt n) by teraflop on Monday November 30, 2015 @07:35PM (#10652926)
Big-O is only strictly meaningful in terms of asymptotic behavior; as soon as you start talking about specific values of N, you have to care about constant factors.

In this case, the constant factors will probably be quite different because the goal is to make better use of CPU cache.

There are no comments on this comment yet.