Finds a dominant element of array in Python

dominant.py

 # Majority Element of an Array (Moore’s Algorithm)

 # If n is odd then it should appear at least (n+1)/2 times
 # If n is even then it should appear at least (n/2) + 1 times


def dominant(A):
    x = None
    count = 0
    for i in A:
        if count == 0:
            x = i
            count += 1
        elif i == x:
            count += 1
        else:
            count -= 1
    return (x, count)

print dominant([3, 1, 3, 4, 3, 9, 3])
print dominant([1, 1, 4, 3, 4, 1, 1, 9])

nice one, but I will do it with a dictionary ;-)

Your code assumes that the first element of the array is the most frequent one,
when you give something else at the beginning it is incorrect.

and print statement needs parenthesis of its own.

Cheers