A Practical Introduction to Data Structures and Algorithm Analysis

INDEX 607199, 200, 203, 247, 249, 273,275, 276, 442implemented by stack, 128–132,256replaced by iteration, 51, 130reduction, 268, 560–566, 586, 588, 589,591relation, 27–29, 50replacement selection, 182, 304–307,309, 314, 316, 481resource constraints, 5, 6, 17, 57, 58run (in sorting), 301run file, 301, 302running-time equation, 60satisfiability, 572–576, 578, 579search, 23, 86, 317–357binary, 31, 77–79, 93–95, 272, 320,352, 359, 360, 374, 493, 502defined, 317exact-match query, 7–8, 10, 317,318, 357in a dictionary, 320interpolation, 320–323, 352jump, 319–320methods, 317multi-dimensional, 459range query, 8, 10, 317, 330, 357,364sequential, 22, 59–60, 63–64, 69,77–79, 94, 95, 318–319, 328,352, 497sets, 329–330successful, 317unsuccessful, 317, 346search trees, 64, 180, 358, 363, 365,372, 452, 456, 459secondary index, 358secondary key, 358secondary storage, 279–288, 311–313sector, 283, 286, 288, 299seek, 285, 286Selection Sort, 241–243, 256, 266, 272self-organizing lists, see list,self-organizingsequence, 27, 30, 51, 100, 318, 329,359, 560, 561sequential search, see search, sequentialsequential tree implementations,223–226, 228, 229serialization, 223set, 25–29, 51, 330powerset, 26, 29search, 318, 329–330subset, superset, 26terminology, 25–26union, intersection, difference, 26,329, 353Shellsort, 239, 244–246, 266, 274shortest paths, 389, 407–411, 420simulation, 89skip list, xvSkip List, 539–545, 556, 557slide rule, 32, 551software engineering, xiii, 4, 20, 560sorting, 18, 22–24, 59, 64, 65, 79–80,83, 86, 235–277, 319, 328,560–563adaptive, 271comparing algorithms, 237,265–267, 309, 310exchange sorting, 243external, 171, 236, 257, 279,298–311, 314–316lower bound, 236, 267–271small data sets, 237, 255, 271, 275stable algorithms, 236, 272, 273