# Program Optimization

Printable View

Show 40 post(s) from this thread on one page
Page 2 of 2 First 12
• September 29th, 2012, 04:10 PM
Norm
Re: Program Optimization
1 2 3 4 5 6 7 8
Then is this correct:
7 beats 1 other cand.
6 beats 2 other cand.
5 beats 3 other cand.
4 beats 4 other cand.
3 beats 5 other cand.
2 beats 6 other cand.
1 beats 7 other candidates
• September 29th, 2012, 04:13 PM
dark3stnit3s
Re: Program Optimization
No i must have misunderstood you

1 would beat all of them
followed by 2

the position from the left determines their place
the first from the left is the first place winner for each voter
• September 29th, 2012, 04:27 PM
Norm
Re: Program Optimization
So the count of the number of candidates that are beaten is not important?
The fact that candidate 1 has beaten 7 other candidates is not useful.
• September 29th, 2012, 04:57 PM
dark3stnit3s
Re: Program Optimization
I cant think of a reason to use it.
• September 29th, 2012, 05:05 PM
Norm
Re: Program Optimization
Is it important which candidate is beaten?

I don't understand the rules.
You said:
1 is the winner because he beats 0 twice and 2 twice.

Is it important who is beaten?
• September 30th, 2012, 12:56 AM
jps
Re: Program Optimization
so your votes in your file:
0 1 2
1 0 2
2 1 0
would fill a table like the following:

Voters In Order | 1stVote | 2ndVote | 3rdVote
First Voter's Card | cand.0 | cand.1 | cand.2
2nd Voter's Card | cand.1 | cand.0 | cand.2
3rd Voter's Card | cand.2 | cand.1 | cand.0

?
• September 30th, 2012, 02:34 AM
helloworld922
Re: Program Optimization
It looks like you're suppose to implement something similar to Instant runoff voting. However, I can't tell how you're handling tie-breakers.
Show 40 post(s) from this thread on one page
Page 2 of 2 First 12