Classical Algorithms in C++

by Wilt, Nicholas

• ISBN13: 9780471109853
• ISBN10: 0471109851
• Edition: Disk
• Format: Paperback
• Copyright: 1995-06-01
• Publisher: John Wiley & Sons Inc

Summary

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

Table of Contents

Acknowledgments
Introduction
Algorithms and Asymptotic Notation	p. 1
Overview of Sorting	p. 19
Asymptotically Slow Sorts	p. 25
Asymptotically Fast Sorts	p. 37
Sorting Wrapup	p. 79
Overview of Searching	p. 87
Searching Arrays	p. 91
Linear Lists	p. 103
Skip Lists	p. 153
Binary Trees	p. 181
Red-Black Trees	p. 209
Splay Trees	p. 231
Searching Wrapup	p. 251
Linear-Time Selection	p. 261
Order Statistics Trees	p. 273
Selection Wrapup and Future Work	p. 283
Appendix A A C++ Refresher	p. 289
Appendix B The Disk	p. 323
Glossary	p. 333
Bibliography	p. 337
Using the Disk	p. 341
Index	p. 343
Table of Contents provided by Blackwell. All Rights Reserved.