At the heart of any computer program are algorithms that sort, search through and select data. If an algorithm (a step-by-step logical procedure) is not well designed, the program will run sluggishly or not at all. Throughout this text, the author argues that programmers should devote extra time, at the outset of a project, to consider exactly how their algorithms will perform sorts, searches and selections. The book is filled with numerous examples of algorithms (and data structures) and has a bias towards the practical rather than the theoretical. The author pays particular attention to two features of C++: templates and exception handling. The accompanying disk contains a C++ class library written by the author. The class library enables programmers to test and implement the algorithms and data structures contained in the book.
- ISBN10 0471109851
- ISBN13 9780471109853
- Publish Date 4 August 1995
- Publish Status Out of Print
- Out of Print 13 August 1999
- Publish Country US
- Imprint John Wiley & Sons Inc
- Pages 352
- Language English