News for hackers. Stuff that matters.
Re:When Simple Wins: Power of 2 Load Balancing by matahwoosh on Monday June 26, 2017 @08:07PM (#14641496)
Generally, yes, but I think `O(log n / log log n) == O(log n)` is wrong.

log(n) / log(log(n)) = logx(n) (where x = log(n), wasn't sure how to describe logarithm base in a better way). So you get O(logx(n)). In general the logarithm base doesn't matter for Big-O when it's a constant, but I'm not sure you can apply the same thing to a base of log(n).

There are no comments on this comment yet.