How good is this book for learning algorithm creation, based on experiences ?
+1
A:
Its a good book but this does not mean it is good for you - maybe you find it at google books so you can have a look in it.
InsertNickHere
2010-06-19 07:42:22
Any other suggestions?
2010-06-19 07:43:29
@learningtolive Have you tried Cormen's *"Introduction to Algorithms?"*
Kotti
2010-06-19 07:44:16
Well I'm a beginner in C++ programming, basically I just want to know for the future...
2010-06-19 07:46:14
Well, it slightly depends on what you want to do with your knowledge. Learning algorithm is good, but learning the most helpful for you is better.
InsertNickHere
2010-06-19 08:09:27
Thanks for answering ;)
2010-06-19 08:17:03
+1
A:
The most common algorithms book I have seen is Cormen, Leiserson, Rivest, and Stein's Introduction to Algorithms, which you may see written elsewhere as CLRS or "The MIT Algorithms Text". It's not quite as pervasive as the Dragon Book is for compiler design, but it's close.
Strictly speaking, when talking about algorithms, the programming language you decide to use rarely makes much of a difference. Algorithms are about speeding up the machine's way of thinking of general problems, not a particular way of processing a particular input with a particular implementation.
Billy ONeal
2010-06-19 07:45:51
@learningtolive: That question doesn't make any sense. That's entirely dependent on how often you program, how well you know a language, how useful algorithms will be for your particular application, how well you "get" algorithms.... there's no way for anyone to reasonably answer that.
Billy ONeal
2010-06-19 07:55:20
@Billy: It makes a difference if your language is purely functional or not :)
FredOverflow
2010-06-19 08:47:06
@FredOverflow: It makes a difference when you go to implement things, but you can implemenent Binary Search or Depth First Search or Breadth First Search or Boyer Moore or ..... it does not matter.
Billy ONeal
2010-06-19 13:42:49
How does a purely functional bubble sort look like? Also quick sort cannot *really* be done in purely functional languages, because one of quick sort's biggest advantages over other many other sorting algorithms is that it can sort in situ, which by definition is impossible in purely functional languages.
FredOverflow
2010-06-19 15:39:17
@FredOverflow: Yes, some algorithms would be different or impossible to implement using functional languages, but the study of algorithms themselves does not change.
Billy ONeal
2010-06-19 16:51:39