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.
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Illustrationen
glossary, bibliography, index
Maße
Höhe: 234 mm
Breite: 188 mm
Gewicht
ISBN-13
978-0-471-10985-3 (9780471109853)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Klassifikation
Introduction To C++; Algorithms And Asymptotic Notation; Part I Sorting: Problem Definition And Lower Bound; Insertion Sort; Selection Sort; Shell Sort; Merge Sort, Recursive And Nonrecursive Forms; Quicksort; Binary Heaps And Heapsort; Wrapup; Part II Searching: Linear Search; Binary Search; Linked Lists; Skip Lists; Binary Trees; Red-Black Trees; Splay Trees; Skip Lists; Dictionaries And Associative Arrays; Part III Order Statistics: Min, Max, And Minmax; Expected-Linear Time Algorithm For Selection; Optimal Linear Time Algorithm For Selection; Optimizing For Small Cases; Order Statistics Trees.
