Lecture Slides

Spring 2020

Most recent postings

  • January 22nd & 27th: Introduction to analysis of algorithms

  • January 27th & 29th: Asymptotic Analysis

  • January 29th & February 3rd: Analyzing Divide-and-Conquer Algorithms

  • February 3rd and 5th: Proofs of correctness using loop invariants

  • February 10th and 12th: Heap-Sort algorithm

  • February 12 and 17: Quick-Sort algorithm

  • February 17: Lower bound on comparison-based sorting algorithms

    • End of material on first exam

  • February 17th and 19th: Non-comparison-based sorting algorithms

    1. Counting Sort video

      Note: this algorithm is different than the one in our textbook, but it has the same running time and outcome.

    2. Radix Sort video

    3. Bucket Sort video.

      See lecture slides on non-comparison-based sorting algorithms for information on bucket sort running time.

  • February 26th: Finding medians and order statistics

  • February 26th and March 2nd: Hash Tables

    1. Adam Blank - Cal Tech lecture slides

  • March 2nd and 4th: Binary Search Trees

  • March 4th: start Red-Black Trees

    •