4 ms·
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 firs
by mk89 7y ago
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.
- robotresearcher 7y agoIt 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?
- deleted 7y ago[deleted]