Chris Tamez’s Reviews > Python Algorithms: Mastering Basic Algorithms in the Python Language > Status Update

Chris Tamez
Chris Tamez is on page 16 of 352
"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.
May 17, 2023 03:25PM
Python Algorithms: Mastering Basic Algorithms in the Python Language (Expert's Voice in Open Source)

flag

Chris’s Previous Updates

Chris Tamez
Chris Tamez is on page 62 of 352
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.
May 26, 2023 10:01AM
Python Algorithms: Mastering Basic Algorithms in the Python Language (Expert's Voice in Open Source)


Chris Tamez
Chris Tamez is on page 62 of 352
May 26, 2023 09:59AM
Python Algorithms: Mastering Basic Algorithms in the Python Language (Expert's Voice in Open Source)


Comments Showing 1-2 of 2 (2 new)

dateUp arrow    newest »

message 1: by Ginni (new)

Ginni Wow Chris, never took you for a quitter.


message 2: by Chris (new) - added it

Chris Tamez New year, new me.


back to top