A Practical Introduction to Data Structures and Algorithm Analysis

IndexJava, xiv–xvii, 19–21generic, xvi, 13file access, 297–298inheritance, xvinew, 431Javageneric, 101new, 115, 122private members, 104abstract data type (ADT), xiv, 8–12,20–22, 51, 99–103, 139–147,158, 171, 173, 206–208, 216,218, 221, 227, 228, 292–297,389, 394, 396, 430, 446, 475,476abstraction, 11accounting, 124, 133Ackermann’s function, 226activation record, see compiler,activation recordaggregate type, 8algorithmdefinition of, 18–19algorithm analysis, xiii, 4, 57–95, 235amortized, see amortized analysisasymptotic, 4, 57, 58, 67–73, 99,481empirical comparison, 57–58, 89,237for program statements, 74–79multiple parameters, 82–83running time measures, 59space requirements, 58, 83–86all-pairs shortest paths, 536–537, 556,559amortized analysis, 76, 118, 327, 481,497–498, 500, 503approximation, 579arraydynamic, 118, 503implementation, 9, 22artificial intelligence, 389assert, xviiassert, xviiasymptotic analysis, see algorithmanalysis, asymptoticATM machine, 7average-case analysis, 63–65AVL tree, 199, 365, 447, 453–456, 475back of the envelope, napkin, seeestimatingbacktracking, 578bag, 26, 51bank, 6–7basic operation, 5, 6, 21, 22, 59, 61, 66599