The beginning is deceptively easy. You have to record preferences. If Alice beats Bob, Alice gets a point. Simple array work. I thought, "Hey, this isn't so bad."
In a Tideman election:
for (int i = 0; i < pair_count; i++)
The problem set challenges you to implement a Ranked Pairs voting system, which is designed to identify a Condorcet winner —a candidate who wins every head-to-head matchup. Cs50 Tideman Solution