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

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

Covers algorithms and their performance analysis, data structures, abstraction, and encapsulation. Introduces stacks, queues, linked lists, trees, heaps, priority queues, and hash tables, and their ...