8612700308

57

58

59

60 61 62 63

56 f

-f-

1......{ fact def count(zs: ZS, n: Z, k: Z): Z

=0,    if k =

= count(zs, n, k - 1),    if k >

= count(zs, n, k - 1) + 1, if k >

[+def tallyVotes(numOfCandidates: Z, votes: ZS)

def plurality(numOfCandidates: Z, votes: ZS):

val taiły: ZS = tallyVotes(numOfCandidates,

val winner: Z = findMaxIndex(taiły)

var j: Z = 0

var tied: B = false

while ( !tied & j < taiły, size) {|

0    (C0)

1 a n * zs(k - 1) (cNe)

1 A n == zs(k - 1) (cEq) }^,,M

ZS = {. . . }

Z = {

votes)

Logika Verified

Programming logie proof is accepted.