gcet wrote: > hi all, > please share ur ideas...if u have time :) > > 3. let a machine known as, equivalence tester, can determine whether > two bank card correspond to the same account by taking two cards at a > time as input and outputting whether they are equivalent. give an > algorithm which invokes equivalence tester at most O(nlgn) to determine > > whether there is a set of more than n/2 equivalent cards in the given n > bank cards.
Why not require at most O(n) equivalence tests? --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
