Yeah, Dave. It is simple, but small correction, we need 5621 games to figure out the winner.
In general, if we are having n participants we need n - 1 games to determine the final winner. We can conclude the fact, by drawing the tournament tree for small numbers and count for the games to be held at each level (an omitted participant can be grouped in next level). Thanks, Regards, Venki. On Feb 25, 7:58 am, Dave <dave_and_da...@juno.com> wrote: > Simpler. Every game eliminates one participant. Since 5,622 > participants must be eliminated to have one winner, it takes 5,622 > games. > > Dave > > On Feb 24, 5:43 pm, bittu <shashank7andr...@gmail.com> wrote: > > > If you had 5,623 participants in a tournament, how many games would > > need to be played to determine the winner > > > According to me if Tournament strategy is is used then i think its > > ok... > > > After each round, you would have half the number that started the > > previous round; except if it were an odd number it would he half + 1. > > So 13 rounds. > > > 2812 1 > > 1406 2 > > 703 3 > > 352 4 > > 176 5 > > 88 6 > > 44 7 > > 22 8 > > 11 9 > > 6 10 > > 3 11 > > 2 12 > > 1 13 > > > Correct me if i am wrong > > Some Discussion Needed..??? > > > Thanks > > Shashank >> "The Best Way to Escape From The Problem is to Solve It" -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
