/Find-Majority-Element-by-Divide-and-Conquer-Algorithm

Primary LanguageC++

Find-Majority-Element-by-Divide-and-Conquer-Algorithm

Find the majority element in a sequence by using divide and conquer algorithm. Running time is O(nlog(n))

##Input Format:

The first line contains an integer n, the next one contains a sequence of n non-negative integers.

5
2 3 9 2 2

##Output(the majority element):

2