http://www.geeksforgeeks.org/archives/503
here is O(n) soln. On Thu, Feb 9, 2012 at 1:15 AM, Prakhar Jain <[email protected]> wrote: > Hello everyone, > > suppose we have an array of size n and a number, say x, and we have to > determine whether the number x is present in the array more then n/2 times > or not....? > can we have an O(log n) algo for determining it......?..pls help...!!! > > -- > -- > Prakhar Jain > IIIT Allahabad > B.Tech IT 3rd Year > Mob no: +91 9454992196 > E-mail: [email protected] > [email protected] > > -- > 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. > -- 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.
