842 days ago,2046 views
Presented by John Bafford (@jbafford)
August 18, 2017
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.