How can does the maximum vote algo apply to the above question..??
please explain..
On 11/8/10, cheng lee wrote:
> Where can we see that this algorithm use the divide and conquer techniques?
>
>
>
>
> 2010/11/7 Pratik Bhadkoliya
>
>> A Linear-time Majority Vote Algorithm
>>
>> Problem: How to d
Where can we see that this algorithm use the divide and conquer techniques?
2010/11/7 Pratik Bhadkoliya
> A Linear-time Majority Vote Algorithm
>
> Problem: How to decide, in one pass which element of a sequence is in the
> majority, provided there is such an element.
>
> As we sweep through
A Linear-time Majority Vote Algorithm
Problem: How to decide, in one pass which element of a sequence is in the
majority, provided there is such an element.
As we sweep through the sequence, we maintain a pair consisting of a current
candidate and a counter. Initially, the current candidate is un
Is'nt this solvable by the majority vote algorithm already discussed in this
list?
Ashim.
On Sun, Nov 7, 2010 at 3:42 AM, lichenga2404 wrote:
> There are many secret groups in College A.Every student at college A
> is a member or these secret group, though membership in one excludes a
> student
There are many secret groups in College A.Every student at college A
is a member or these secret group, though membership in one excludes a
student from joining any other group. You wish to determine if any one
of these groups contains more than half of the student population. To
achieve this , you
