Newsflash

powered_by.png, 1 kB
JoomlaMonkey Welcome arrow Amazon Store

Message from Dean - May 8th 2007

I am currently testing out a new version of the APF Bridge Component - If you notice any errors within this demo store please drop me a line.

Algorithms in C++ Part 5: Graph Algorithms (3rd Edition) (Pt.5)

Current Store: US / World Store
In association with Amazon.com

UK Store | Canadian Store | French Store | German Store

Books : Algorithms in C++ Part 5: Graph Algorithms (3rd Edition) (Pt.5)

  


 : Algorithms in C++ Part 5: Graph Algorithms (3rd Edition) (Pt.5)

List Price: $49.99
Amazon.com's Price: $48.99
You Save: $1.00 ( 2%)
Prices subject to change.



Availability: Usually ships in 24 hours



This item ships for FREE with Super Saver Shipping.
Binding: Paperback
Dewey Decimal Number: 005.133
EAN: 9780201361186
Edition: 3
ISBN: 0201361183
Label: Addison-Wesley Professional
Manufacturer: Addison-Wesley Professional
Number Of Items: 1
Number Of Pages: 528
Publication Date: January 06, 2002
Publisher: Addison-Wesley Professional
Studio: Addison-Wesley Professional




Alternate Versions: Click to Display
Related Items: Browse for similar items by category:

Editorial Review:

Amazon.com Review:
Robert Sedgewick's Algorithms series has earned a place among the classics of computer books. Algorithms in C++ provides a comprehensive collection of classic algorithms for sorting, searching, parsing, geometrical manipulation, and more. The book includes not just C++ code but detailed--yet readable--explanations of how it works and what each algorithm's advantages and disadvantages are in terms of execution time and memory demands. An invaluable and timeless resource.

Product Description:
Covers an enormous scope of information, with extensive treatment of searching and advanced data structures, sorting, string processing, computational geometry, graph problems, and mathematical algorithms. Provides clear and relevant insight into why the algorithms work. Softcover.



Customer Reviews
Average Rating:  out of 5 stars

Rating: 3 out of 5 stars - Plain average!
This is an okay book. The algorithms are described in great detail (actually sometimes too much detail), moreover it is not very mathematical. For this reason it could be the choice for the readers fed up of the math in other algorithms books e.g., Cormen et al's.

However the biggest complain I have with this book is that it is overloaded with too much contents. When things could have been described in a few lines, dozens of paragraphes have been used for it. The reader just losts in the text. And interestingly the job is still not done, i.e., the reader is still not able to follow the algorithms easily.

Also for this reason it is not a good choice for someone wants to get a quick overview or revision.




Rating: 4 out of 5 stars - Bought this to complete the series...
I don't intend to read this book from front to back (well maybe one day if I get really bored) but I think this book does a very good job explaining the algorithm without getting obsessed with overly formal mathematical games. In my opinion the graphs are the most important part of the series, since these are the algorithms and data structures that usually AREN'T included in a programming language's libraries; STL for example. You will find many of these topics in a mathematics and statistics program (how I first encountered them) so the book does get mathematical, but out of necessity.

4 out of 5 stars for sometimes being unclear.



Rating: 3 out of 5 stars - Best of the bunch
I had to teach this course and must see it is the pick of the books I have seen on this subject though it is far from ideal. Why can't these people use meaningful variable names and comment the code. Is it the authors intent to teach bad programming practice.



Rating: 3 out of 5 stars - Good content but hard to read
I'm a learned industrial engineer in electronics but got into informatics right after my degree. So I never had a course on algorithmic and had to learn nearly everything by myself.

After some years of working in the field, I tought it was maybe time to get some background on the subject so I got this (now an outdated edition) of the book.

Well, it was the book it took the longest to me to finish in the informatics field.

The book explains a whole bunch of basic and more advanced general-purpose algorithms, and so has a good coverrage of the subject.

However, there are two problems with the book:

1) The coding style is very bad: the author likes to use global variables, and variable names are often very cryptic. Example:
* p = parent
* g = grandparent
* gg = greatgrandparent
* c = child
* x = current node
* y = temporary node
...

2) You cannot read this book's chapters in a random way: ... Read More



Rating: 2 out of 5 stars - to difficult to understand
i feel writer is confused and writes very jumbled together spaghetti code.
to tough to uderstand
horrible reference book




Availability: Usually ships in 24 hours



 

 

© 2007 - 2008 Joomla Monkey - a web property of Dean Marshall Consultancy Limited
Website maintained by Lancaster website designer - Dean Marshall

Dean Marshall Consultancy - Lancaster web designers and Joomla experts
Web Designer Lancaster
Web Designers Lancaster
Lancaster Web Designer
Lancaster Web Designers
Expert Joomla Hosting
Expert Joomla Hosting
Expert Joomla Hosting
Expert Joomla Hosting
CMS Training
CMS Training
Editable Sites Editable Web Sites Joomla Consultant
Joomla Consultants
Joomla Consultant
Joomla Consultants