Lectures

Lectures notes will appear here.

• Lecture 1: Introduction
  Introduction
• Lecture 2: Union-Find
  QuickFind, QuickUnion, WeightedQuickUnion, PathCompression
• Demo: Union-Find
  QuickFind
• Demo: Union-Find
  QuickUnion, WeightedQuickUnion, PathCompression
• Lecture 3: Analysis of Algorithms
  Measuring performance, Order of growth classifications
• Lecture 4: Stacks and Queues
  Stacks, queues, array and linked implementations, generics
• Lecture 5: Basic Sorting Algorithms
  Selection sort, insertion sort, shellsort
• Demo: Selection Sort
  Selection sort
• Demo: Insertion Sort
  Insertion sort
• Demo: Shell Sort
  Shell sort
• Lecture 6: Mergesort
  Mergesort, comparators, stability
• Demo: Mergesort
  Mergesort
• Lecture 7: Quicksort
  Quicksort, duplicate keys
• Demo: Quicksort Partitioning
  Quicksort partitioning
• Lecture 8: Priority Queues
  Priority queues, binary trees, binary heaps, heapsort
• Demo: Binary Heap
  Binary heap
• Demo: Heapsort
  Heapsort
• Lecture 9: Elementary Symbol Tables
  
• Lecture 10: Binary Search Trees
  
• Demo: Binary Search Trees
  Binary search trees
• Lecture 11: Balanced Search Trees
  2-3 trees, red-black trees
• Demo: 2-3 Trees
  2-3 trees
• Demo: Red-Black Binary Search Trees
  Red-black binary search trees