Data Structures and Algorithm Analysis - Computer Science at ...

INDEX 581comparing algorithms, 224–225,251–253, 294exchange sorting, 230–231external, xv, 161, 224, 243, 265,283–295, 298–300internal, xvlower bound, 224, 253–257small data sets, 225, 242, 257, 260stable algorithms, 224, 258terminology, 224–225spatial data structure, 429, 440–453splay tree, 170, 188, 349, 429, 434,437–440, 453, 454, 456, 461,517stable sorting alorithms, see sorting,stable algorithmsstack, 93, 117–125, 140, 141, 189, 193,242, 258, 259, 262, 383–385,477array-based, 117–118constructor, 117implementations compared, 121insert, 117linked, 120pop, 117, 118, 120, 142push, 117, 118, 120, 142remove, 117terminology, 117top, 117–118, 120two in one array, 121, 140variable-size elements, 142Strassen’s algorithm, 524, 533strategy, see design pattern, strategysubclass, see object-orientedprogramming, class hierarchysubset, see set, subsetsuffix tree, 455summation, 30–32, 39, 40, 49, 50, 70,71, 88, 170, 177, 240, 241,308, 309, 409, 461–466, 471,473, 474, 476, 477, 479guess and test, 479list of solutions, 31, 32notation, 30shifting method, 463–466, 475,480swap, 28tape drive, 268, 283text compression, 145, 178–188,312–313, 335, 339Θ notation, 66–68, 87topological sort, 371, 384–388, 400total order, 26, 47, 171Towers of Hanoi, 34–36, 123, 535, 542tradeoff, xiii, 3, 13, 73, 271, 283disk-based space/time principle,80, 332space/time principle, 79–80, 95,115, 178, 333transportation network, 371, 388transpose, 311, 312, 337traveling salesman, 543–545, 552, 553,563, 565traversalbinary tree, 123, 145, 149–153,158, 163, 170, 189, 380enumeration, 149, 163, 212general tree, 197–198, 216graph, 371, 380–388treeheight balanced, 354, 355, 357, 517terminology, 145trie, 154, 178, 188, 251, 429–434, 454,455alphabet, 430binary, 430PATRICIA, 431–434, 453, 454tuple, 25Turing machine, 548two-coloring, 422-3 tree, 170, 342, 350–354, 357, 360,367, 368, 434, 481, 516