Re:Issue 224182 - chromium - Chrome wakes me up in the middl...
by rational_indian on Wednesday March 27, 2013 @09:17AM
(#5449178)
Why O(log n)? Is there a binary search involved somewhere (for example)? All you have got to do to find out how many people voted for it is to look at the vote count and this seems like an O(1) operation doesn't it?
[ Parent
| on HN ]
Re:Issue 224182 - chromium - Chrome wakes me up in the middl...
by asdfaoeu on Wednesday March 27, 2013 @09:41AM
(#5449294)
The number n has log(n)/log(10) digits so it technically take log(n) time to read it.