[algogeeks] Re: find the most occured (more than N/2 times , where N is the length of the array) element in an array

[Karthik Singaram L]

Hi guys,
          A rather different approach to the problem
          The idea is that the number is appearing more than N/2 times is the majority.
         1. Pair the consecutive elements like 1st an 2nd element, 3rd and 4th and so on
         2. Now if both elements in the pair are the same choose both else drop both
         3. Repeat steps 1 and 2 till we are left with the majority element alone
         Worst case (N/2+1) is element X and (N/2-1) is element Y, this would take nlogn.
         Regards
         karthik
           


--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---