The latest addition to Robert Sedgewick's popular series of bookscarries his comprehensive collection of algorithms into anobject-oriented programming (OOP) environment with implementationin the C++ programming language. These algorithms cover a broadrange of fundamental and more advanced methods: sorting, searching, string-processing, geometric, graph, and mathematicalalgorithms. The algorithms are all expressed in terms of conciseimplementations in C++, so that readers can both appreciate theirbasic properties and test them on real applications. The treatment of analysis of algorithsm is carefully developed. When appropriate, analytic results are discussed to illustratewhy certain algorithms are prefered, and in some cases, therelationship of the proactical algorithms being discussed topurely theoretical results is also described. The ultimate aim of the book is to improve programming practice, whatever the environment, whatever the implementation language. Sedgweick describes the basic methods to be considered in everycase. Features *Hundreds of detailed, innovative figures clearly demonstratehow important algorithms work.*Throughout the book, properties sections encapsulatespecific information on the performance characteristics ofalgorithms. *Six chapters discuss fundamental concepts, including a briefintroduction to data structures. Algorithms in C++ provides readers with the tools to implement, run, and debug useful algorithms with confidence. This book is ahelpful guide for users engaged in the transition to orexperimentation with OOP and/or the C++ language. It may be usedfor self study, or as a reference for developers or computersystems or applications progra
I read most of this again recently to refresh my knowledge of basic algorithms while interviewing for a new job. It has good coverage of many areas of computer science. I felt the use of C++ was a bit superfluous as most of the algorithms could have been coded just as well in, say, C. I was also slightly surprised that the code presented was already highly optimized, with tricky edge conditions exploited in non-obvious ways, rather than presenting less optimized but easier to follow code.
Overall, though, it's a useful, well written reference work, if slightly dated now.
This is a wonderful programming book explaining various algorithms with sample code. In this 1992 release of the book there were several code examples that were not correct; however, this still did not detract from the usefulness of the book. Thus, I still give it a good rating. As a fellow computer scientist, it was well organized, I learned much from the topics, and I enjoyed the reading. The challenge of attempting to understand the algorithms, and fixing some of them, was well worth it.