11.1c — Create PT: Build Day 2

The algorithm contract — annotate yours to match:

// SEQUENCING: these lines run in THIS order, on purpose
public int ScoreHand(List<Card> cards, int bonus)   // ← parameters
{
    int total = 0;                                    // 1. start
    for (int i = 0; i < cards.Count; i++)            // 2. ITERATION
    {
        Card c = cards[i];
        if (c.cost <= 3)                             // 3. SELECTION
        {
            total += c.attack + bonus;
        }
        else
        {
            total += c.attack / 2;
        }
    }
    if (total > 20) { total = 20; }                   // 4. SELECTION, again
    return total;                                     // 5. output
}

Why the exam loves this shape: it is not hard; it is COMPLETE. Sequencing is the spine, selection makes decisions, iteration handles many items, and the procedure takes PARAMETERS so callers can reuse it. Your 10.2d AI score method IS this algorithm — you have been writing rubric answers all year without knowing the rubric's name.

Build order for the day:

1. Write the procedure with parameters (two beats: what it processes, what it decides on). Name the parameters well — they appear in your screenshots and WR.
2. Call it from three different places — a call per context proves reuse, and graders read calls as "this is real behavior, not a demo."
3. Print before/after: Debug.Log(...) the input state and output state at each call site. Input → behavior → output, made visible.
4. Break it on purpose (5 min): empty list, zero, one item, giant item. Fix what crashes. The PT video cannot crash — you have ONE take.