Question

All,

I am a mid level python developer with a master’s degree in Web Technologies, and while I consider my self a decent programmer, I always have trouble with algorithm complexity related questions.

Anyone suggest a good book to explain how to derive the O notation of an algorithm, and what common solutions to complex algorithms can be used?

I am currently reading “Uncle Bob’s” The Clean Coder: A Code of Conduct for Professional Programmers (a well worth read by the way, I highly recommend it), and in it he dedicates a chapter to explain how spending 20 hours outside of work a week improving your craft is the only way to become a better programmer. So I thought I’d start with algorithm complexity and move to Big Table and Closure afterwards.

Answer 1

Introduction to Algorithms by Thomas Cormen seems to be the go-to manual for the industry. It covers a wide range of topics including sorting, data structures, advanced design and analysis, and graph algorithms.

Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.