http://userweb.cs.utexas.edu/users/moore/best-ideas/mjrty/index.html
_Asit On Wed, Sep 22, 2010 at 9:12 AM, pre <pre.la...@gmail.com> wrote: > Hi all, > pls help me solve this problem.. > Design an algorithm to find the majority element of an array.. > majority element must be an element tht has the cardinality greater > than 2n/3 where n is the number of elements in the array and the time > complexity must be a linear time.. ie o(n).. > > hint : use mode or median to solve .. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
