Draft - Advanced Sorting and Analysis Layers
Authoring skeleton - differentiated CS113 implementation
Three short topic clusters
- Quicksort partitioning and comparison with existing merge sort.
- Heapsort and heap reuse.
- Bubble, Shell, and radix alternatives with explicit input constraints.
PBL context
Sort calendar or train-product snapshots in a student prototype. Do not replace repository ordering or production services simply to demonstrate an algorithm.
Implementation layers to author
Students implement selected advanced algorithms according to readiness, then compare against existing selection/insertion/merge examples. Define partition invariants, Shell gap choices, and radix handling of sign and key width.
Evidence checklist to author
Verify order and preservation of input values using empty, singleton, repeated, sorted, reversed, and fixed mixed inputs. Count operations across sizes; do not rely only on wall-clock timings. Complete evidence before week 36 presentations.
Publication checklist
Complete examples, a CodeRunner exercise, and tests before assigning courses.csa.week, removing draft/hide flags, or enabling submissions.
Code Runner Challenge
Authoring draft - advanced sorting exercise is not ready
View IPYNB Source
// CODE_RUNNER: Authoring draft - advanced sorting exercise is not ready
public class SortingDraft {
public static void main(String[] args) {
throw new UnsupportedOperationException("Draft: author the selected sort and verification tests before publication.");
}
}
SortingDraft.main(null);