int ranks[candidate_count]; for (int j = 0; j < candidate_count; j++)
To manually test, try a 3-candidate case where a cycle would occur: Cs50 Tideman Solution
return 0;