Algorithmic complexity theory is an important part of computer science, but many developers are unaware of it. What does it mean when we say a function or an algorithm is efficient? How can we tell if we can do better? I help answer these questions and more with an overview and simple examples.
Complexity theory. Big-O. Constant, linear, logarithmic, and quadratic time versus 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 few developers actively think about, and you’ll walk away with a new way of looking at code and thinking about problems.