contents hash tables with worst-case ( access perfect hashing cuckoo hashing hopscotch hashing universal hashing extendible hashing summary exercises references priority queues (heaps model simple implementations binary heap structure property heap-order property basic heap operations other heap operations applications of priority queues the selection problem event simulation -heaps leftist heaps leftist heap property leftist heap operations skew heaps binomial queues binomial queue structure binomial queue operations implementation of binomial queues priority queues in the standard library summary exercises references sorting preliminaries insertion sort the algorithm stl implementation of insertion sort analysis of insertion sort lower bound for simple sorting algorithms