News for hackers. Stuff that matters.
Re:Issue 224182 - chromium - Chrome wakes me up in the middl... by Jabbles on Wednesday March 27, 2013 @08:08AM (#5448874)
You can star it. That would tell the developers how many people care about it in O(1) time, without having to wade through O(n) comments.

Alright, O(log n) time.

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?
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.
Re:Issue 224182 - chromium - Chrome wakes me up in the middl... by fyi80 on Thursday March 28, 2013 @01:55AM (#5453489)
only if log(n) > 7. Otherwise, subitization gives constant time reading of the magnitude of n.
Re:Issue 224182 - chromium - Chrome wakes me up in the middl... by tripzilch on Thursday March 28, 2013 @08:20PM (#5458519)
Technically, O(log(n) <= 7 ? 1 : log(n)) is still O(log(n)) ... :)