August 2017 – US
Presented by John Bafford (@jbafford)
|Date:||August 17, 2017|
18:00 PDT, 3:00 CEST (Aug 18), 2:00 BST (Aug 18)
This meeting is over, but you can still purchase the video.
Complexity Theory. Big-O. Constant, linear, logarithmic, and quadratic time vs. space trade-offs. What does it actually mean when we say a function or an algorithm is efficient? How can we tell if we can do better? Join me, on this tour through a corner of computer science that few developers actively think about, and you’ll discover a new way of looking at code and thinking about problems.