Cs50 Tideman Solution «QUICK»

// Structure to represent a voter typedef struct { char preferences[MAX_CANDIDATES][MAX_NAME_LENGTH]; } Voter;

// Eliminate the candidate(s) with the fewest votes int eliminated_candidates = 0; while (eliminated_candidates < num_candidates - 1) { // Find the candidate with the fewest votes int min_vote_index = -1; for (int i = 0; i < num_candidates; i++) { if (candidates[i].votes == min_votes) { min_vote_index = i; break; } } Cs50 Tideman Solution

// Find the new minimum votes min_votes = MAX_VOTERS; for (int i = 0; i < num_candidates; i++) { if (candidates[i].votes >= 0 && candidates[i]. // Structure to represent a voter typedef struct

char* tideman(Candidate candidates[], int num_candidates, Voter voters[], int num_voters) { // Count first-choice votes for (int i = 0; i < num_candidates; i++) { candidates[i].votes = 0; } for (int i = 0; i < num_voters; i++) { for (int j = 0; j < num_candidates; j++) { if (strcmp(voters[i].preferences[j], "") != 0) { for (int k = 0; k < num_candidates; k++) { if (strcmp(candidates[k].name, voters[i].preferences[j]) == 0) { candidates[k].votes++; } } break; } } } while (eliminated_candidates &lt

// Update preferences for (int i = 0; i < num_voters; i++) { for (int j = 0; j < num_candidates; j++) { if (strcmp(voters[i].preferences[j], candidates[min_vote_index].name) == 0) { for (int k = j; k < num_candidates - 1; k++) { strcpy(voters[i].preferences[k], voters[i].preferences[k+1]); } strcpy(voters[i].preferences[num_candidates-1], ""); j--; } } }

# Eliminate the candidate(s) with the fewest votes eliminated_candidates = [] while len(min_vote_candidates) > 0: eliminated_candidate = min_vote_candidates[0] eliminated_candidates.append(eliminated_candidate) candidates.remove(eliminated_candidate)