News for hackers. Stuff that matters.

A comment on When your data doesn’t fit in memory: the basic techniques. Parent comment

Re:When your data doesn’t fit in memory: the basic techniques by tehsauce on Monday November 11, 2019 @05:43PM (#21509721)
O(log n) is not constant
[ Parent | on HN ]
Re:When your data doesn’t fit in memory: the basic techniques by mark-r on Monday November 11, 2019 @05:54PM (#21509803)
I think the point in this case is that log n has a reasonable upper bound, and can be considered constant for any real world problem.
[ Parent | on HN ]