Tag: Boyer–Moore majority vote algorithm

Given an array of integers, the majority number is the number that occurs more than half of the size of the array. Find it in O(n) time and O(1) …