we can do one thing. compare first element with all others. if it matches with any of them, we have found our number, else leave the first number and now the required number is available (n/2)+1 times in the rest of the array, which can be found in O(n)
-- 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.
