cs-008 — Shuffling a Playlist
| Field | Value |
|---|---|
| id | cs-008 |
| difficulty | Expert |
| topics | pseudocode, randomness, constraints |
| lecture | lecture-02 |
| estimated time | 5-minute attempt + 10-minute discussion |
| prerequisites | the full Block I-III toolbox and proof-shaped reasoning |
| objective | make and justify design decisions where the method itself is the challenge |
| solution | held by the instructor; discussed after the attempt |
Problem
Write pseudocode for a shuffle that plays every song exactly once but never two songs by the same artist back-to-back. The interest is in stating constraints and repair steps precisely.
Your deliverable is the stated assumptions, the rule list, the decision for the worked instance, and one contested case. If the problem is ambiguous anywhere, state the assumption you are making and carry on — a stated assumption is part of a good answer.
Examples
- Input: playlist A(pop), B(pop), C(jazz), D(pop), E(jazz)
- Output: e.g. A, C, B, E, D - all songs once, no two same-artist adjacent; same-artist-majority needs a repair rule
Solve for the worked instance first. Then ask what would change if one number, name, or condition were replaced by something stranger.
What to notice
- Greedy: place songs round-robin by artist, then fix remaining pairs by reinsertion.
- Writing the rules IS the solution; code is transcription.
- Every assumption is a place where two good answers can differ.
Discussion starter
After the solution is revealed, the class spends five minutes on this prompt: "Which assumption would you attack first if you had to argue the other side?"
Constraints and assumptions
- Difficulty: Expert (independent design decisions and proof-shaped arguments assumed).
- Topics: pseudocode, randomness, constraints.
- Classroom-scale inputs unless the problem says otherwise.
- Time-box: about five minutes for the attack plan; the full argument may exceed the box - outline the proof strategy instead of grinding details.
- Optional stretch (not required): describe an alternative approach and say when it beats the obvious one.
Hints and extension
- First nudge: identify the pattern the worked instance uses before computing anything.
- If stuck after three minutes, write the input/output line you expect and trace the smallest example by hand.
- After the reveal, attempt the extension below before the next lecture.
- Extension challenge: Express the solution so precisely that a classmate can execute it without questions.