A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.

Next, we introduce the heap data structure and the basic properties of heaps ... a technique that simplifies hashtable design. Next we will study the design of hash functions and their analysis.

The design, implementation, and analysis of abstract data types, data structures and their algorithms. Topics include: data and procedural abstraction, amortized data structures, trees and search ...

and hash tables, and their physical representation. Discusses efficient sorting (quicksort and heapsort) and experimental algorithm analysis. Examines several design issues, including selection of ...