title: algorithms and complexity book
body: <p>All,</p>
  
  <p>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.  </p>
  
  <p>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?</p>
  
  <p>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.</p>