Cs50 | Tideman Solution

eliminate_candidate(candidates_list, candidates, eliminated);

count_first_place_votes(voters_prefs, voters, candidates_list, candidates);

return 0; } The implementation includes test cases to verify its correctness. For example, consider the following input: Cs50 Tideman Solution

The winner is: 1 This indicates that candidate 1 wins the election.

Tideman is a voting system implemented in the CS50 course, where voters rank candidates in order of preference. The goal of the Tideman solution is to determine the winner of an election based on the ranked ballots. In this report, we will outline the problem, provide a high-level overview of the solution, and walk through the implementation. The goal of the Tideman solution is to

// 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; } } } }

// 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; } } } we will outline the problem

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

int winner = check_for_winner(candidates_list, candidates); while (winner == -1) { // Eliminate candidate with fewest votes int eliminated = -1; int min_votes = voters + 1; for (int i = 0; i < candidates; i++) { if (candidates_list[i].votes < min_votes) { min_votes = candidates_list[i].votes; eliminated = candidates_list[i].id; } }

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