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 mk89 on Tuesday November 12, 2019 @12:03PM (#21515711)
Do you have any resource mentioning that the algorithm runs in O(logn) time or space? This is really new to me, sorry. I don't mean to argue, it's just the first time I hear such a thing.
[ Parent | on HN ]
Re:When your data doesn’t fit in memory: the basic techniques by robotresearcher on Tuesday November 12, 2019 @12:37PM (#21516066)
It takes O(log n) bits to represent the value n, here the number of lines counted so far.

Does it make sense when expressed compactly like that?

[ Parent | on HN ]