Skip to content

Algorithms (Yorgey)

This collection of activities was developed for Algorithms (CSCI 382) at Hendrix College. Most were developed by Brent Yorgey, with some contributions also by Gabe Ferrer.

The activities are at https://github.com/byorgey/algorithms-POGIL.

Contents

  1. Intro to POGIL
  2. Brute Force Algorithms
  3. Reasons for POGIL
  4. Greatest Common Divisor Analysis
  5. Asymptotic Analysis: Introduction
  6. Asymptotic Analysis: Definitions
  7. Asymptotic Analysis: Limit Theorems
  8. Asymptotic Analysis: Three Proofs
  9. Graphs: Introduction
  10. Graphs: Breadth First Search
  11. Graphs: Dijkstra’s Algorithm
  12. Minimum Spanning Trees
  13. Graphs: Kruskal’s Algorithm
  14. Divide and Conquer: Introduction
  15. Divide and Conquer: Arithmetic
  16. Divide and Conquer: Selection
  17. Dynamic Programming: Introduction
  18. Dynamic Programming: 2D
  19. Dynamic Programming: Floyd-Warshall
  20. Flow Networks: Introduction
  21. Flow Networks: Max Flow
  22. Amortized Analysis: Introduction
  23. Amortized Analysis: Arrays
  24. Amortized Analysis: Binomial Heaps
  25. Reductions: Introduction
  26. Reductions: SAT and 3-SAT
  27. Linear Sorting

Metadata

Download .bib file

Field Value
author Brent Yorgey
title Activities for Algorithms
url https://github.com/…
month November
year 2025