A Practical Introduction to Data Structures and Algorithm Analysis

INDEX 603constant, 60, 69exponential, 61, 66, 67linear, 61, 65–67, 86quadratic, 61, 65–67, 86halting problem, 581–588Hamiltonian cycle, 589handle, 439Harmonic Series, 34, 325, 496hashing, 7, 10, 31, 64, 318, 330–351,357, 358, 372, 428, 473, 502analysis of, 346–350bucket, 338–339, 356closed, 336–345, 354collision resolution, 331, 337–345,350, 352deletion, 350–351, 355double, 345, 354dynamic, 352hash function, 331–336, 354home position, 337insert, 339linear probing, 339–342, 345, 349,350, 354, 356load factor, 346open, 336–338perfect, 331, 352primary clustering, 342–345probe function, 340–345probe sequence, 339, 341–346,348, 350, 351pseudo-random probing, 343, 345quadratic probing, 344, 345, 354search, 340table, 330tombstone, 350header node, 127, 136heap, 153, 155, 171, 180–188, 190,199, 201, 204, 256–259, 277,410, 417building, 182–187for memory management, 431insert, 182, 185max-heap, 181min-heap, 181, 304partial ordering property, 181remove, 187, 188siftdown, 185–187, 277heapsort, 277Heapsort, 182, 256–259, 266, 304heuristic, 579–580hidden obligations, see obligations,hiddenHuffman coding tree, 153, 155, 163,188–199, 201–204, 229, 448prefix property, 197independent set, 589index, 12, 273, 357–385file, 300, 358inverted list, 361, 383linear, 8, 359–361, 383, 385tree, 358, 364–382induction, 156–157, 185, 193–194, 199,228, 272, 417, 487–489, 502induction, proof by, see proof, inductioninheritance, 101, 104, 110, 144, 165,166, 168, 170, seeobject-oriented programming,inheritanceinorder traversal, see traversal, inorderinput size, 59, 63Insertion Sort, 80, 238–239, 241,243–246, 256, 266, 268–270,272, 274–276Double, 276