• Post Reply
  • Bookmark Topic Watch Topic
  • New Topic

fundamental algorithm book sugestion

 
RabiDas Sharma
Ranch Hand
Posts: 69
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Hello Everyone
I want to buy my 1st algorithm book
seeing plenty of books in amazon.com got confused.
please tell me which book can give sufficient fundamentals and
also provide comprehensive knowledge in algorithms.
I have C and java knowledge and also pursued certifications in each of them.
what more prerequisite knowledge is necessary to understand and
appreciate each and every points of the book.

Please suggest a fundamental algorithm book..

thanks in advance
 
Jim Venolia
Ranch Hand
Posts: 246
2
Chrome Linux VI Editor
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
I thought I'd replied to this, sorry if this shows up twice.

In the 80's I bought Sedgewick's book "Algorithms". In college the 2nd edition was a textbook for one of my classes. Great book, but as I graduated in '91 there may be better books out now.

Well hey, lookie what I found shutting down tabs so I can go to bed. Not the Sedgewick book, nor have I read the chapters, but it's free.
 
Winston Gutkowski
Bartender
Pie
Posts: 10527
64
Eclipse IDE Hibernate Ubuntu
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
RabiDas Sharma wrote:Please suggest a fundamental algorithm book..

Well, this one is usually regarded as the granddaddy of them all. And if it takes you less than 10 years to get through the whole thing, you're a better man than I am.

Winston
 
Ulf Dittmer
Rancher
Posts: 42968
73
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Knuth is a great book, but I wouldn't recommend it to anyone who is not well-versed in CS and algorithms already. I used and liked http://www.amazon.com/Introduction-Algorithms-Thomas-H-Cormen/dp/0262033844 in grad school.
 
Joe Areeda
Ranch Hand
Posts: 331
2
Java Netbeans IDE Tomcat Server
  • Likes 1
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
I hate to show my age but I took most of my CS courses in the '60s and '70s. The algorithms we studied are things I use often but hardly ever have to implement. These days most of that stuff is in libraries, documented and tested libraries.

What kind of algorithms do CS students study in 2013 and beyond?

I don't mean to imply that Knuth is outdated as a good understanding of how things work under the covers helps in a lot of ways. But I can't remember the last time I had to implement anything in there. My copy of Numerical Recipes is well worn but also hasn't been doing much more than gathering dust and answering "how do they do that" kind of questions.

I find most of my reading these days is more about technologies, design patterns and the underlying science of the applications I'm working on. Some of Bear's comments, for example, have got me deep into servlets trying to get my code up to (what I think) are his standards.

Again, I'm not trying to disuade the OP from learning fundamental algortihms, I'm just wondering which ones are practical these days?

Joe
 
K. Tsang
Bartender
Posts: 3521
16
Android Java
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Algorithms and data structures often go together. Learning the basics is crucial for any potential programmer yet back college such course often isn't the first programming course.

Anyway for general purpose I would suggest the Cormen book (the linked Ulf provided earlier). Yet having a programming specific algorithms reference (usually the web) is also good.
 
Ulf Dittmer
Rancher
Posts: 42968
73
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
The fundamentals probably haven't changed much (even though Knuth books were comprehensively updated in the nineties). Another classic that's now available for free is Wirth's Algorithms and Data Structures, see http://www.coderanch.com/how-to/java/HereYouWillFindLinksToFreeStuff for the link.

I think the practical value is not so much learning the exact algorithms covered -I concur that one would rarely have to implement those- as the discussion of what approaches are computationally faster than others - Big-O notation and all that. Looking at my copy of Algorithms that I mentioned earlier, the only actual algorithms we covered that I would use say broadened my mind were Dynamic Programming and Minimum Spanning Trees. (We'd already done sorting, searching, trees, hashing, NP-completeness etc. earlier, which are all also good to know.)
 
  • Post Reply
  • Bookmark Topic Watch Topic
  • New Topic