borodina boruvkao bottom-up insertion in red-black trees - bound timesamortized - bounds of function growth boyerr braces (})balancing - brackets (]balancing - operator see operators breadth-first searches brightj brodalg brodera brownd brownm brualdir bucket sort - buildbinomialqueue function buildheap function for binary heaps - for heapsorts for huffman algorithm - for leftist heaps burchn +call-by-rvalue-reference copy-and-swap idiom decltype lvalue - - lvalue reference - move assignment operator - move constructor - - range for loop rvalue - - rvalue reference - - size_t - - std::move - std::swap - unordered_map - unordered_set - -style arrays and strings - call-by-rvalue-reference callsstacks for - capacity function for binomial queues for vectors - carlssons carmichael numbers carterj carter-wegman trick cartesian trees cascading cuts for fibonacci heaps caseinsensitivecompare class catalan numbers chaining for hash tables - changh changl changs change function chanzyp character sets character substitution problem - charactersarrays of chazelleb checkers chenj cheritond cheriyanj chess children in trees - christofidesn circle packing problem circular arrays circular linked lists circular logicrecursion as classes and class templates - accessors for compilation - explicit instantiation - constructors for - defaults for - destructors for - interface/implementation separation in - string and vector - syntax for clear function for containers for lists - for priority queues - for vectors - clearyj clique problem clocks for event simulation - for random numbers clone function for binary search trees for binomial queues for leftist heaps for red-black trees for top-down splay trees closest points problem divide and conquer strategy - references for clustering in hash tables code bloat cohenj coin changing problem collections collisions in hashing - double hashing - linear probing - quadratic probing - coloring graphs combinesiblings function combinetrees function - comerd commandspreprocessor - comparable objects - for binary search trees compareandlink function comparison-based sorting comparisons arrays with iterators pointers in selection problem - strings compilation - - explicit instantiation in - hash tables for for header information