Clif Kussmaul - Algorithms and Computation

These activities were developed by Clif Kussmaul for Computer Science 2 in Java.
For sample versions, click here. For full access, contact Clif Kussmaul.

Stage	Activity Name
5: Endorsed	Searching in Hi-Lo (listed in Computer Science 0)
3: Refined	Hash Tables: I: Concepts; II: Collisions
3: Refined	(Linked) Lists: I: Abstraction; II: Implementation
3: Refined	Stacks & Queues I: Stacks; II: Queues
3: Refined	Sorting I: Sort & Compare
(not yet written)	Sorting II: Simple Sorts
3: Refined	Sorting III: Merge Sort
3: Refined	Sorting IV: Split Sort (Quicksort)
2: Piloted	Sequence Analysis
2: Piloted	Graphs I, II, III

Matt Lang - Algorithms and Computation

These activities were developed by Matt Lang for Algorithms and Computation.
For full versions, click here. For details, contact Clif Kussmaul.

Stage	Activity Name
3: Refined	ALG_AN: Algorithm Analysis I & II
2: Piloted	ALG_BFS: BFS & Bipartite Graphs
2: Piloted	TH_NFA: Nondeterministic FAs
3: Refined	TH_RE: Polynomial Time Reducibility

Brent Yorgey - Algorithms and Computation

These activities were developed by Brent Yorgey for Algorithms and Computation. For more information, contact Brent Yorgey.

Stage	Activity Name
2: Piloted	01: Intro: Inputs, Outputs, Brute Force
2: Piloted	02: Greatest Common Divisor, Euclid’s Algorithm
2: Piloted	03: Asymptotic Analysis I: O, Omega, Theta
2: Piloted	04: Asymptotic Analysis II: Proofs
2: Piloted	05: Graphs: Terminology, Proofs
2: Piloted	06: Breadth First Search
2: Piloted	07: Dijkstra’s Algorithm
2: Piloted	08: Minimum Spanning Trees
2: Piloted	09: Divide and Conquer Intro
2: Piloted	10: Divide and Conquer Arithmetic
2: Piloted	11: Dynamic Programming
2: Piloted	12: 2D Dynamic Programming
2: Piloted	13: Flow Networks
2: Piloted	14: Amortized Analysis
2: Piloted	15: Reductions