Skip to content

Instantly share code, notes, and snippets.

@kinoute
Created June 9, 2020 12:42
Show Gist options
  • Save kinoute/fd6f021d782e5415c335c0fc1e5ebc0b to your computer and use it in GitHub Desktop.
Save kinoute/fd6f021d782e5415c335c0fc1e5ebc0b to your computer and use it in GitHub Desktop.
Harvard CS50 Plurality
#include <cs50.h>
#include <stdio.h>
#include <string.h>
// Max number of candidates
#define MAX 9
// Candidates have name and vote count
typedef struct
{
string name;
int votes;
}
candidate;
// Array of candidates
candidate candidates[MAX];
// Number of candidates
int candidate_count;
// Function prototypes
bool vote(string name);
void print_winner(void);
int main(int argc, string argv[])
{
// Check for invalid usage
if (argc < 2)
{
printf("Usage: plurality [candidate ...]\n");
return 1;
}
// Populate array of candidates
candidate_count = argc - 1;
if (candidate_count > MAX)
{
printf("Maximum number of candidates is %i\n", MAX);
return 2;
}
for (int i = 0; i < candidate_count; i++)
{
candidates[i].name = argv[i + 1];
candidates[i].votes = 0;
}
int voter_count = get_int("Number of voters: ");
// Loop over all voters
for (int i = 0; i < voter_count; i++)
{
string name = get_string("Vote: ");
// Check for invalid vote
if (!vote(name))
{
printf("Invalid vote.\n");
}
}
// Display winner of election
print_winner();
}
// Update vote totals given a new vote
bool vote(string name)
{
for (int i = 0; i < candidate_count; i++)
{
if (strcmp(candidates[i].name, name) == 0)
{
candidates[i].votes += 1;
return true;
}
}
return false;
}
// Print the winner (or winners) of the election
void print_winner(void)
{
// find the most votes count
int max_votes = 0;
for (int i = 0; i < candidate_count; i++)
{
max_votes = (candidates[i].votes > max_votes) ? candidates[i].votes : max_votes;
}
// get the candidates with the max_votes (handle tie)
for (int i = 0; i < candidate_count; i++)
{
if (candidates[i].votes == max_votes)
{
printf("%s\n", candidates[i].name);
}
}
return;
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment