Majority Element

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.

You may assume that the array is non-empty and the majority element always exist in the array.

int majorityElement(int* nums, int numsSize) {
    int i;
    int flag;
    int count = 0;
    for(i = 0; i < numsSize; i++)
    {
        if(0 == count)
        {
            flag = nums[i];
            count = 1;
        }
        else
        {
            if(nums[i] != flag)
                count--;
            else
                count++;
        }
    }
    return flag;
}