Comments by "EebstertheGreat" (@EebstertheGreat) on "The Most Important Algorithm Of All Time" video.

  1. The base of the logarithm doesn't really matter. All logs differ only by a constant factor anyway. So if some algorithm has complexity ϴ(n log n) for some base, it has complexity ϴ(n log n) for every base.
    1