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?

help me solving this prob..the solution can be in C or just an algo
thanks

[Zhuge]

Where is your code? We aren't going to write it for you.

[tantel]

i want some algo..not the code..i havent wrote the code yet..want some idea

[EzwRko23]

Why divide and conquer? This can be solved in O(n) with just a linear sweep and cannot be done better.