Re:Big-O notation explained by a self-taught programmer
by BeetleB on Saturday October 29, 2016 @01:19PM
(#12825019)
Mathematicians used it for asymptotic expansions of mathematical expressions.
Its use in computer science for algorithmic complexity came later. In fact, I believe in the early TAOCP, Donald did not use big O, but instead would derive the full expression where possible.
Its use in computer science for algorithmic complexity came later. In fact, I believe in the early TAOCP, Donald did not use big O, but instead would derive the full expression where possible.