Divide and Conquer-169. 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.

Credits:
Special thanks to @ts for adding this problem and creating all test cases.

int majorityElement(int* nums, int numsSize) {
    if(numsSize == ||numsSize == )
        return *nums;  

    int x = majorityElement(nums,numsSize / );
    int y = majorityElement(nums + numsSize / ,numsSize - numsSize / );  

    if(x == y)
        return x;  

    else
    {
        int countX = ;
        int countY = ;  

        for(int i = ;i < numsSize;i++)
        {
            if(*(nums + i) == x)
                countX++;  

            else if(*(nums + i) == y)
                countY++;
        }  

        return countX > countY ? x : y;
    }  

}