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 ...

Tour of the most important data structures, fundamental algorithms, and algorithm design techniques: lists, stacks, queues, dynamic arrays, hash tables, heaps, priority queues, disjoint set unions, ...

Next, we introduce the heap data structure and the basic properties of heaps ... analyze the complexity of the randomized quicksort/quickselect algorithms. We will learn open address hashing: a ...

An introduction to the analysis and implementation of algorithms and data structures including linear data structures, trees, graphs, hash tables, searching algorithms, sorting algorithms, ...