-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathplurality.c
79 lines (69 loc) · 1.58 KB
/
plurality.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
#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)
@@ -49,6 +48,7 @@ int main(int argc, string argv[])
candidates[i].name = argv[i + 1];
candidates[i].votes = 0;
}
int voter_count = get_int("Number of voters: ");
@@ -75,7 +75,7 @@ bool vote(string name)
int i;
for(i=0 ; i < candidate_count ; i++)
{
if(strcmp(name , candidates[i].name)==0)
if(strcmp(name, candidates[i].name)==0)
{
candidates[i].votes++ ;
return true;
}
}
return false;
}
// Print the winner (or winners) of the election
void print_winner(void)
{
// TODO
int max_vote = 0;
for (int i=0 ; i < candidate_count ; i++)
{
if(candidates[i].votes > max_vote)
{
max_vote = candidates[i].votes;
}
}
for (int i=0 ; i < candidate_count ; i++)
{
if(candidates[i].votes == max_vote)
{
printf("%s\n",candidates[i].name);
}
}
return;
}