Printable View
I want to learn more popular algorithms to accomplish common tasks, ie. Dijkstra's and A* search, and I want to learn more popular data structures, ie. minheaps, search trees. I am interested in a book that is full of examples so I know when to best apply certain algorithms under certain situations. Is there any books you guys would strongly recommend for me?
I saw a book in the book store today that looked really nice - Numerical Recipes. $80. Not reading for the faint of heart. I would also second Knuth's set - The Art of Computer Programming". $160 for the 3 volume set.
Todd
the accu's book review link is down now :(. All the links and books you guys have provided have been extremely helpful and they will be books I'll be putting on my desk once I graduate from school. Next thing I'm going to do is print out some of these algorithms and make a wallpaper out of them
Heres a link to some videos on algorithms
http://ocw.mit.edu/OcwWeb/Electrical...otes/index.htm
Knuth's TAOCP is the most difficult set of books on algorithms I've ever seen. They are exceptional, but will require work unlike any other algorithms text you will find, and they're missing a lot of modern data structures like treaps and skip lists.
These lectures are outstanding; especially the ones by Charles Leisorson (the bald guy). If you follow these, buy the CLRS book, and do the homework assignments from that page you will get an extremely thorough but more manageable intro to algorithms.Quote:
Originally Posted by eaane74
This book (CLRS) is outstanding, and a much easier read than TAOCP.
http://www.amazon.com/Introduction-A...2830205&sr=8-2