ABSTRACT
This topic is very important in practice: paying attention to the computational complexity of an algorithm as it’s being designed can make the difference between a program that won’t finish before the universe ends and a program that finishes in an hour or two.
