Classical Algorithms in C++: With New Approaches to Sorting, Searching, and Selection/Book and Disk - Softcover

Wilt, Nicholas

 
9780471109853: Classical Algorithms in C++: With New Approaches to Sorting, Searching, and Selection/Book and Disk

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Über die Autorin bzw. den Autor

NICHOLAS WILT is a software engineer who has spent a third of his life programming microcomputers. In addition to writing numerous articles for Dr. Dobb's Journal, C/C++ Users Journal, and PC Techniques, he is the author of Object-Oriented Ray Tracing in C++, also available from Wiley.

Von der hinteren Coverseite

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

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.