Created
May 23, 2020 20:10
-
-
Save araidz/ae11d6099bb9bb0b32d9d984b5c13717 to your computer and use it in GitHub Desktop.
CS50 Pset3 Plurality
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#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) | |
{ | |
// TODO | |
for (int i = 0; i < candidate_count; i++) | |
{ | |
if (strcmp(candidates[i].name, name) == 0) | |
{ | |
candidates[i].votes++; | |
return true; | |
} | |
} | |
return false; | |
} | |
// Print the winner (or winners) of the election | |
void print_winner(void) | |
{ | |
// TODO | |
// Sort both votes and name arrays in ascending order | |
for (int i = 0; i < candidate_count; i++) | |
{ | |
for (int j = i + 1; j < candidate_count; j++) | |
{ | |
if (candidates[i].votes > candidates[j].votes) | |
{ | |
int temp_vote = candidates[i].votes; | |
candidates[i].votes = candidates[j].votes; | |
candidates[j].votes = temp_vote; | |
string temp_name = candidates[i].name; | |
candidates[i].name = candidates[j].name; | |
candidates[j].name = temp_name; | |
} | |
} | |
} | |
// All candidates are tied | |
if (candidates[candidate_count - 1].votes == candidates[0].votes) | |
{ | |
for (int i = 0; i < candidate_count; i++) | |
{ | |
printf("%s\n", candidates[i].name); | |
} | |
} | |
// Top 2 candidates are tied | |
else if (candidates[candidate_count - 1].votes == candidates[candidate_count - 2].votes) | |
{ | |
printf("%s\n", candidates[candidate_count - 1].name); | |
printf("%s\n", candidates[candidate_count - 2].name); | |
} | |
// Single winner | |
else | |
{ | |
printf("%s\n", candidates[candidate_count - 1].name); | |
} | |
return; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment