Cs50 Tideman Solution

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

eliminate_candidate(candidates_list, candidates, eliminated); Cs50 Tideman Solution

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

// Function to check for winner int check_for_winner(candidate_t *candidates_list, int candidates) { // Check if any candidate has more than half of the first-place votes for (int i = 0; i < candidates; i++) { if (candidates_list[i].votes > candidates / 2) { return i + 1; } } return -1; } return 0; } The implementation includes test cases

// 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; } } } printf("The winner is: %d\n"

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