index huangb huffmand huffman codes - hullsconvex hutchinsonj hypotheses in induction - if/else statements in running time implementation/interface separation - implicit type conversions with constructors impossible problems incerpij #include preprocessor increasekey function increment sequences in shellsorts - indegrees of vertices - inductive proofs process - recursion in - infinite loop-checking programs infix to postfix conversion - information hiding information-theoretic lower bounds inheritance for lists init function - initialization list for constructors inorder traversal input size in running time - insert function and insert operations - trees - avl trees - double rotation - single rotation - -trees - binary heaps - binary search trees - - binary searches binomial queues - - -heaps - extendible hashing fibonacci heaps hash tables - huffman algorithm iterators leftist heaps - linked lists - lists - maps multiway merges pairing heaps priority queues - red-black trees - - sets - skew heaps skip lists - splay trees - treaps - insertion sorts - algorithm - analysis - implementation - insertionsort function - instantiationexplicit - intcell class constructors for - defaults for - interface/implementation separation in - pointers in - integers greatest common divisors of - multiplying - interface/implementation separation - internal path lengths inversion in arrays - isactive function isempty function for binary heaps for binary search trees for binomial queues for leftist heaps for top-down splay trees islessthan function isomorphic trees isprime function iterated logarithm iterators const_iterator - for container operations erase getting for lists - for maps - methods for - for sets - stale iyengars jansons jiangt johnsond johnsond johnsons jonassena jonesd josephus problem -colorable graphs - trees - kaasr kaehlere kahna kaned karatsubaa kargerd karlina karltonp karpr karkkainenj karzanova kasait kayaln kernighanb kevin bacon game keys in hashing - for maps - khoongc kingv