Use Boyer-Moore Majority Vote Algorithm to find number with frequency greater than n/2.

• Iterate through array, keeping track of candidate and count

• If count becomes 0, update candidate to current elemen...read more