Consider an array A[1 . . . n]. A value x is called a strict majority element of A if strictly more than half of the elements in A are equal to x—in other words, if
Give a proof by contradiction that every array has at most one strict majority element
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here