Week 34: Efficient Project Algorithms

Week 34 of Sprint 9: OCS Project v2.0 and N@tM.

Learning goals

✓Compare Recursive, Memoized, and Tabulated Solutions

✓Implement Quicksort and Heapsort; Analyze Their Work

✓Compare Bubble, Shell, and Radix Sort Layers and Input Constraints

✓PBL Extension - Benchmark Student Sorts over Calendar Events or Train Products

The existing sorting-analysis exercise supports benchmarking. Dynamic programming and complete quick/heap/shell/radix instruction still need authoring; the drafts are not scheduled. Choose only algorithms already learned until those lessons are ready.

This week

Start: Sorting/Searching Algorithms - Sorting Homework → Week 34 Chat

Computer Science A

Week 34: Efficient Project Algorithms