Cs50 Tideman Solution Online

// Function to recount votes void recount_votes(voter_t *voters_prefs, int voters, candidate_t *candidates_list, int candidates) { // Recount votes for (int i = 0; i < voters; i++) { for (int j = 0; j < candidates; j++) { if (candidates_list[voters_prefs[i].preferences[j] - 1].votes == 0) { // Move to next preference voters_prefs[i].preferences[j] = -1; } else { break; } } } }

count_first_place_votes(voters_prefs, voters, candidates_list, candidates);

3 3 1 2 3 1 3 2 2 1 3 This input represents an election with 3 voters and 3 candidates. The output of the program should be: Cs50 Tideman Solution

printf("The winner is: %d\n", winner);

int main() { int voters, candidates; voter_t *voters_prefs; read_input(&voters, &candidates, &voters_prefs); } else { break

candidate_t *candidates_list = malloc(candidates * sizeof(candidate_t)); for (int i = 0; i < candidates; i++) { candidates_list[i].id = i + 1; }

// Allocate memory for voters and candidates *voters_prefs = malloc(*voters * sizeof(voter_t)); candidate_t *candidates_list = malloc(*candidates * sizeof(candidate_t)); } } } } count_first_place_votes(voters_prefs

// Function to read input void read_input(int *voters, int *candidates, voter_t **voters_prefs) { // Read in the number of voters and candidates scanf("%d %d", voters, candidates);