Demystifying Algorithmic Complexity

August 2017 – US

Presented by John Bafford (@jbafford)

Date: August 17, 2017
Time: 20:00 CDT

18:00 PDT, 3:00 CEST (Aug 18), 2:00 BST (Aug 18)
Not sure of the time in your area? Check it on

This meeting is over, but you can still purchase the video.

Purchase 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.

John Bafford

John Bafford

John Bafford has built web applications with PHP and JavaScript since 1999. He enjoys working with open source software, hiking, and home brewing.

Leave a Reply

Your email address will not be published. Required fields are marked *

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <s> <strike> <strong>