List operations are not interchangeable
A single winner, a complete ordering, non-repeating draws, pairs, a gift cycle, and a fixture list can all start with the same six names. Their rules differ. A picker samples one category; a shuffle permutes every entry; a round robin enumerates combinations without randomizing them. Choose the output structure before entering the roster.
Count the object being allocated
Six equal names give a one-in-six chance for a single pick, 720 possible full orders, three disjoint pairs, or 15 unique two-person combinations. A duplicated line adds another chance. An odd number of people leaves one person outside a pairing. These are properties of the list and rule, not details the browser can infer from a desired result.
State exceptions before the result
Decide who is eligible, whether names may recur, what happens to a late arrival, and whether related people may be matched. A Secret Santa cycle prevents self-gifts but does not prevent household matches. A random bracket does not award byes fairly unless the bye rule was set first. Recording the original roster makes a group decision auditable.
Check an output against its rule
Count names after a shuffle, count pairs after grouping, and count each competitor's appearances in a round robin. For a weighted choice, turn the weights into fractions before sampling. For a bracket, verify that every entrant has one opening position. These small checks catch a malformed list or misunderstood rule earlier than a second random click, which cannot undo an unclear procedure.
Use chance only where it belongs
Random order is useful for equal turns and casual groups. It is not a substitute for a safety qualification, a legal queue, skill balancing, or a policy for unequal work. When the real decision has those conditions, apply them to the list before any selection is made.