Divide and Conquer Algorithm

[tantel]

let A[1…n] be an array of integers. Design an efficient divide and conquer algorithm to determine if A contains a majority element, i.e. an element appears more them n/2 times in A. What is the time complexity of your algorithm?


please help me with solving this question
can be a C program or just an algorithm
thanks