Rod Stephens

“To get the most out of an algorithm, you must be able to do more than simply follow its steps. You need to understand the following: The algorithm's behavior. Does it find the best possible solution, or does it just find a good solution? Could there be multiple best solutions? Is there a reason to pick one “best” solution over the others? The algorithm's speed. Is it fast? Slow? Is it usually fast but sometimes slow for certain inputs? The algorithm's memory requirements. How much memory will the algorithm need? Is this a reasonable amount? Does the algorithm require billions of terabytes more memory than a computer could possibly have (at least today)? The main techniques the algorithm uses. Can you reuse those techniques to solve similar problems?”
― Rod Stephens, Essential Algorithms: A Practical Approach to Computer Algorithms