Once the pairs are tallied, they must be sorted by victory margin. While CS50 provides a sort_pairs function signature, the student must implement the sorting logic. This usually involves Bubble Sort or Selection Sort (taught in earlier lectures), but applied to an array of structs. It reinforces the concept that sorting is not just about numbers—it is about ordering complex objects based on a specific property (the margin of victory).
// Modified lock_pairs function with verbose output bool lock_pairs_verbose(void) { printf("\n=== LOCKING PAIRS (with cycle detection) ===\n"); cs50 tideman
display_pair_votes(i); }
to your tideman.c file (after your existing code) Once the pairs are tallied, they must be