A Practical Introduction to Data Structures and Algorithm Analysis

INDEX 601composite, see design pattern,compositecomposite type, 8computability, 20, 581, 588computer graphics, 448, 459connected component, see graph,connected componentcontradiction, proof by, see proof,contradictioncylinder, see disk drive, cylinderdata item, 8data member, 9data structure, 5, 9costs and benefits, xiii, 3, 6–8definition, 9philosophy, 4–6physical vs. logical form, xvi, 9,12–13, 99, 182, 282, 293, 423selecting, 5–6spatial, see spatial data structuredata type, 9decision problem, 569, 573, 589decision tree, 268–271decompositionimage space, 448key space, 448object space, 447depth-first search, 389, 401–403, 418,442, 503deque, 150dequeue, see queue, dequeuedesign pattern, xiv, 12–16, 21composite, 15–16, 167, 471flyweight, 13–14, 167, 203,470–471strategy, 16, 146visitor, 14–15, 161, 402, 422Deutsch-Schorr-Waite algorithm, 443,446dictionary, 173, 345–346, 449ADT, 139–146, 318, 356, 385, 531Dijkstra’s algorithm, 409–411, 413,420, 421, 536Diminishing Increment Sort, seeShellsortdirected acyclic graph (DAG), 391, 404,420, 424, 442discrete mathematics, xv, 49disjoint set, see equivalence classdisk drive, 9, 279, 282–313access cost, 286–288, 311cylinder, 283, 363organization, 282–286disk processing, see file processingdivide and conquer, 250, 252, 255, 320,488, 493–495document retrieval, 330, 352double buffering, 290, 302, 304dynamic array, see array, dynamicdynamic memory allocation, 106dynamic programming, 578efficiency, xiii, 3–580/20 rule, 325, 350element, 25homogeneity, 100, 119implementation, 118–119Emacs text editor, 441, 443encapsulation, 9enqueue, see queue, enqueueentry-sequenced file, 357enumeration, see traversalequation, representation, 164equivalence, 27–28class, 27, 205, 210–216, 226–228,230, 416, 417, 421, 422, 476