Status Updates From Python Algorithms: Masterin...

A lot of this math is just over my head. I can see it and can jump just high enough to grab parts of it, but can't fully grasp everything. Really good stuff, though, even with the extra/missing words that didn't get caught.

"The expression O(g) for some function g(n), represents a set of functions and a function f(n) is in the set if it satisfies the following condition: their existing natural number n(naut) and a positive constant C such that f(n) <= cg(n) for all n >= n(naut).... This is a fairly straightforward and understandable definition..."

Oof. This may be a tough read. We'll see if I make it all the way.