Algorithm Book

[Gandalf_Grey_]

OK i learn by reading books, that i just how i learn, i have 10 books on my shelf right now (computers only, not including the 50 or so sci fi books ) totalling about 5 or 6 hundred dollars worth. I have learned a whole bunch of languages now i want to buy a book that will teach me stuff not about only one language but something i can apply to all languages, a book on algorithms. Any sugestions? i found this one

http://chapters.indigo.ca/item.asp?C...82646B59BA1211

it seems to have gotten some good reviews, many people referenced it in reviews of bad books and it is about $100 (CND) anyone else recomend a better one?

[BigGlass]

This is a big one. It is used for a lot of undergraduate courses in several countries but for self study it is necessary a good background in math. Several chapters are indicated only for graduate courses and some problems are very difficult.

I sugest you search in the net for handouts on Algoritms, for example Dave Mount and Ian Pamberry. They are teacher in some university, I can't remember where.

Handouts are free (normally you can download it) and give a good ideia about books, because normally they are based in someone.

I have more than 20 andress pages where has handouts but I can't find them. If you can't find any, please tell me and I'll make a new attempt in my CD's.

[BigGlass]

Starts here:

http://www.softpanorama.org/Algorithms/algorithms.shtml

[Gandalf_Grey_]

thanks

[jim mcnamara]

Most of the common algorithms in use today are found in

Knuth 'The Art of Computer Programming'
Someone with good algebra skills can read this - but all the examples are in old (not hard to read) computer languages. At least the version I have is. (1968).

For doing math

'Numerical Recipes in C' or 'Numerical Recipes in BASIC'

[BigGlass]

Sorry Jim, I can't agree.

'The Art of Computer Programming' is a reference for Master and
PHD courses. Even the new edition is very hard.

Knuth admit it and put the math for use this book in a light form on the book 'Concrete Mathematics'. Maybe light for last year undergradute courses.

Robert Sedgwick a Knuth's phd course disciple in Stanford (and a excelent book writer about algorithms) writes 'Introduction to Analisys on Algorithms' and says it is introductory text for Knuth's Book. For both ('Introduction to Analisys on Algorithms' and 'Concrete Mathematics') it is necessary a good skill on recourence relations, sums, calculus, discrete probalistics, discrete mathematics, combinactories, series, etc..

Knuth says that we don´t need mathemathics skill to 'The Art of Computer Programming', we can skip the mathematics analisys. It is OK but I think it is like go to a restaurant smell the food and go back.

[BigGlass]

My mistake,

the correct name of Sedgwick's Book is 'An Introduction to the Analysis of Algorithms' . Some comments:


http://www.amazon.com/exec/obidos/AS...271835-9680910

[Gandalf_Grey_]

well the depth of the math doesn't bother me, i love math and will learn whatever it takes