What books would you recommend after Cormen?

Question

During my first year at the uni everyone told me that every good programmer should read Cormen's "Introduction to algorithms" and remember it. After 3 years of being lazy I finally managed to read it (and understand+remember most of it/everything) and it kinda interested me (also I realized I'd probably get the job I was applying for had I read this book few months ago). Now the question is are there any other books every programmer should read. And the second question is: what books about algorithms would you recommend after Cormen (I understand it depends on what algorithms I want to learn etc. but I'm looking for something more universal like a more advanced Cormen but still about something every programmer could use).

@Down: well I guess I should first learn how to find useful information, thank you.

Answer 1

Now the question is are there any other books every programmer should read.

For that, see the answers to What is the single most influential book every programmer should read?

And the second question is: what books about algorithms would you recommend after Cormen

The only general books on algorithms that I could recommend you read after CLRS are Knuth's The Art of Computer Programming (I haven't read them yet, but I use them as a reference). Anything else is really not going to be as in-depth. You could also try Skiena's The Algorithm Design Manual for a different approach to the subject.

Other than those, I think you'd need to look for books that are more specific to one area, like sorting, searching, graph alogorithms... what ever you're interested in.

Answer 2

I would suggest Udi Manber's, Introduction to algorithms: a creative approach.

Answer 3

Also check out andand's excellent answer to a similar question here.

Answer 4

Well, it all depends on the area of your requirement & area of interest. The most fascinating materials i feel are
1. MIT open courseware
2. http://code.google.com/edu/ ---> which most of them dont know. Only people who are interviewd by google know it. after reading them i got interested in sorting applications.
3. Algortihms design manual, 2nd edition.
4. Go thru robert sidgewick books, who has done his phd in only quick sort, which took 14 years to implemnt quicksort algorithm efficiently.
5. Algorithms & theory of Computational Handbook ( written by various people from MIT purdue etc..., i guess! this one is of your need)

enjoy!

Answer 5

Well, Cormen's book (as you probably know..) is merely an introduction to the field of algorithms; It covers a lot of topics - mostly the main highlights of each one. Also, there a lot of fields that were not covered in Cormen's book such as learning theory and AI (2 subjects that I find very interesting)

Before you choose your next book, think and do some research about the subjects that interest you the most - and buy the book that will deepen your knowledge in that specific field. Another introductory book will be a waste of time, as most of them cover more or less the same material...