Each game eliminates one participant 5622 will have to be eliminated, so 5622 games.
On Wed, Jan 12, 2011 at 3:09 PM, manoj lalavat <[email protected]>wrote: > check this... > > Tournament Algorithm > > Another method is tournament algorithm. The idea is to conduct a knockout > minimal round tournament to decide the ranks. It first organises the games > (comparisons) between adjacent pairs and moves the winners to next round > until championship (the first best) is decided. It also constructs the > tournament tree along the way. Now the second best element must be among the > direct losers to winner and these losers can be found out by walking in the > binary tree in O(log *n*) time. It organises another tournament to decide > the second best among these potential elements. The third best must be one > among the losers of the second best in either of the two tournament trees. > The approach continues until we find k elements. This algorithm takes O(n + > k log *n*) complexity, which for any fixed *k* independent of *n* is O(*n* > ). > > > On Wed, Jan 12, 2011 at 3:05 PM, bittu <[email protected]> wrote: > >> if you had 5,623 participants in a tournament, how many games would >> need to be played to determine the winner >> >> Regards >> Shashank >> >> >> -- >> 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. >> >> > > > -- > -- > Manoj Lalavat > > > -- > 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.
