Median Can be found out in O(n) times (kth order statistic)
On Sat, Jul 3, 2010 at 4:46 PM, Akash Gangil <[email protected]> wrote: > Hi Amir > > On Fri, Jul 2, 2010 at 10:13 PM, Amir hossein Shahriari < > [email protected]> wrote: > >> both problems can be done in O(n) >> pick the first two elements count the number of their appearances in the >> array ( O(n) ) >> if they are not the result we now that there is an element that is >> repeated n times in 2n-1 elements and we can do the moore's algorithm for >> finding it here's a link to this algorithm: >> userweb.cs.utexas.edu/~moore/best-ideas/mjrty/index.html<http://userweb.cs.utexas.edu/%7Emoore/best-ideas/mjrty/index.html> >> >> I didnt understand the algo correctly what is the sequence is > > > C C C C C A A B B A B > > now the last current candidate is B 1 > but B is certainly not in majority. Can you please explain that to me? > > > > >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]<algogeeks%[email protected]> >> . >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > > > -- > Best Regards > Akash Gangil > > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > 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 [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
