Classical Algorithms in C++: With New Approaches to Sorting, Searching, and Selection

By Nicholas Wilt

The most complete collection of C++ sorting, searching, and selecting algorithms available anywhere... Every computer program performs sorting, searching, and selection, and Classical Algorithms in C++ gives you everything you need to design, test, and implement powerful, efficient algorithms in C++ to perform these tasks. You'll learn to easily incorporate a wide range of algorithms into new and existing C++ programs. This unique book/disk set provides the most sophisticated algorithm analysis techniques you'll find anywhere, along with expert practical advice on how to maximize the performance of algorithms and data structures. Inside you'll find: Ready-to-use examples of C++ algorithms and data structures Each algorithm analyzed, dissected, and fully explained Implementations using the most recent features of C++, including templates and exception handling A variety of powerful sorting algorithms including Selection Sort, Insertion Sort, Merge Sort, Quicksort, and Heapsort Unique and efficient implementation of Binary Heaps Searching algorithms including Linear Search, Binary Search, and Interpolation Search Data structures for searching, such as linear lists, skip lists, and several types of binary trees Techniques for performing selection on arrays and dynamic data sets On the disk you'll find: The author's exclusive C++ class library, which allows you to implement all algorithms and data structures in the book Extensive sample code for using and testing data structures and algorithms

• Format: Paperback
• Language: English
• ISBN: 0471109851
• ISBN13: 9780471109853
• Release Date: July 1995
• Publisher: Wiley
• Length: 368 Pages
• Weight: 3.69 lbs.
• Dimensions: 9.3" x 0.8" x 7.5"

Customer Reviews

Excellent Reference for students of Computer Science

This is by far one of the clearest most easily understandable studies of the complex topic of algorithm analysis and data structure analysis. The author, utlizing a practical approach, creates an easy to read experience, and a very enjoyable one. Overall, an excellent text, and I recommend it to anyone who has ever tried to figure out what the difference between a red-black tree and a binary search tree really was.