index partitions in - trees in quicksorts - in selection problem - passing parameters - patashniko paths augmenting - binary search trees compression - in directory structures - graph halving leftist heaps - shortest see shortest path algorithms in trees patrascum pattern matching problem - percdown function percolatedown function - percolation strategies for binary heaps - for heapsorts perfect hashing - perlisa petersonw petties phases in shellsorts - pippengern pivots in quicksorts - place function - planar graphs plane partitions in - trees plaugerp plaxtonc plies pobletep pohli pointers - in binary search trees - for lists operations for - pointsclosest - polygonsconvex polyphase merges - poonenb pop function for priority queues for stacks - pop_back function for lists for stacks for vectors - pop_front function for lists for vectors portg position of list elements positive-cost cycles postfix expressions - infix conversion to - stacks for - postorder traversal - - potential functions - costs of for splay trees pow (powerfunctions - prattv prefix codes preorder traversal preparataf preprocessor commands - primr prim' algorithm - primary clustering in hash tables prime numbers probability of - proofs for sieve of eratosthenes for tests for - prime table size for hash tables print function in square - for iterators - printable characters printcollection function printhighchangeables function printing queues for recursion for - printlist function printout function printpath function printrange function printtree function for binary search trees for binary trees - for red-black trees - for top-down splay trees priority_queue class - priority queues - binary heaps for see binary heaps -heaps - for dijkstra' algorithm for heapsorts - in huffman algorithm implementations of leftist heaps - model for - references for for selection problem - for simulation - skew heaps - in standard library - priority search trees private labels probability distribution functions probing in hash tables linear - quadratic - processor scheduling problem - progress in recursion proofs - - proper ancestors in trees proper descendants in trees pruning alpha-beta - in backtracking algorithms pseudorandom numbers public labels puechc pughw puglisis push functions for priority queues for stacks - push_back function for lists for stacks for vectors -