Cs50 Tideman Solution – Fully Tested

// Get the names of the candidates Candidate candidates[num_candidates]; for (int i = 0; i < num_candidates; i++) { printf("Enter candidate %d: ", i+1); scanf("%s", candidates[i].name); candidates[i].votes = 0; }

// Find the new minimum votes min_votes = MAX_VOTERS; for (int i = 0; i < num_candidates; i++) { if (candidates[i].votes >= 0 && candidates[i].

// 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--; } } } Cs50 Tideman Solution

return 0; }

// Find the candidate with the fewest votes int min_votes = MAX_VOTERS; for (int i = 0; i < num_candidates; i++) { if (candidates[i].votes < min_votes) { min_votes = candidates[i].votes; } } // Get the names of the candidates Candidate

if winner is not None: print(f"\nThe winner is: {winner}") else: print("\nNo winner.")

# Run the Tideman algorithm winner = tideman(candidates, pairs) for (int i = 0

def tideman(candidates, pairs): # Count first-choice votes vote_counts = {candidate: 0 for candidate in candidates} for pair in pairs: vote_counts[pair[0]] += 1