Talk in English - US at Mid-Atlantic Developer Conference 2019

Short URL: https://joind.in/talk/5979d
(QR-Code (opens in new window))

Avg. Rating

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.

## Comments

Comments are closed.

Really clear explanation of the concepts built up from simple ideas to more complex. Easy to follow and well-delivered.