3 ms·

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) tim

by Jabbles 14y ago

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.

rational_indian 14y ago
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?
- asdfaoeu 14y ago
  The number n has log(n)/log(10) digits so it technically take log(n) time to read it.
  - fyi80 14y ago
    only if log(n) > 7. Otherwise, subitization gives constant time reading of the magnitude of n.
    - tripzilch 14y ago
      Technically, O(log(n) <= 7 ? 1 : log(n)) is still O(log(n)) ... :)