// Function to count first-place votes void count_first_place_votes(voter_t *voters_prefs, int voters, candidate_t *candidates_list, int candidates) { // Initialize vote counts to 0 for (int i = 0; i < candidates; i++) { candidates_list[i].votes = 0; }
// Count first-place votes for (int i = 0; i < voters; i++) { for (int j = 0; j < candidates; j++) { if (j == 0) { candidates_list[voters_prefs[i].preferences[j] - 1].votes++; } } } } Cs50 Tideman Solution
// Function to eliminate candidate void eliminate_candidate(candidate_t *candidates_list, int candidates, int eliminated) { // Decrement vote counts for eliminated candidate for (int i = 0; i < candidates; i++) { if (candidates_list[i].id == eliminated) { candidates_list[i].votes = 0; } } } i++) { candidates_list[i].votes = 0
// Allocate memory for voters and candidates *voters_prefs = malloc(*voters * sizeof(voter_t)); candidate_t *candidates_list = malloc(*candidates * sizeof(candidate_t)); printf("The winner is: %d\n"
count_first_place_votes(voters_prefs, voters, candidates_list, candidates);
printf("The winner is: %d\n", winner);