Directory
Search for:
Videos
Course: Algorithms, Part I. Click here to go back.
- Course Introduction
- Dynamic Connectivity
- Quick Find
- Quick Union
- Quick-Union Improvements
- Union−Find Applications
- Analysis of Algorithms Introduction
- Observations
- Mathematical Models
- Order-of-Growth Classifications
- Theory of Algorithms
- Memory
- Stacks
- Resizing Arrays
- Queues
- Generics
- Iterators
- Stack and Queue Applications (optional)
- Sorting Introduction
- Selection Sort
- Insertion Sort
- Shellsort
- Shuffling
- Convex Hull
- Mergesort
- Bottom-up Mergesort
- Sorting Complexity
- Comparators
- Stability
- Quicksort
- Selection
- Duplicate Keys
- System Sorts
- APIs and Elementary Implementations
- Binary Heaps
- Heapsort
- Event-Driven Simulation (optional)
- Symbol Table API
- Elementary Implementations
- Ordered Operations
- Binary Search Trees
- Ordered Operations in BSTs
- Deletion in BSTs
- 2−3 Search Trees
- Red-Black BSTs
- B-Trees (optional)
- 1d Range Search
- Line Segment Intersection
- Kd-Trees
- Interval Search Trees
- Rectangle Intersection
- Hash Tables
- Separate Chaining
- Linear Probing
- Hash Table Context
- Symbol Table Applications: Sets (optional)
- Symbol Table Applications: Dictionary Clients (optional)
- Symbol Table Applications: Indexing Clients (optional)
- Symbol Table Applications: Sparse Vectors (optional)