An array arr has n/4 copies of a particular unknown element x. Every other element in arr has at most n/8 copies. Give an O(logn) time Monte Carlo alorithm to identify x. The answer should be correct with high probability.
-- 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.
