For 3rd, if we only want winner, Then 1110 players must lose. So total 1110 games.
On Tue, Jul 19, 2011 at 10:37 AM, sagar pareek <[email protected]>wrote: > 1. Let's say > > S=D=N > > repeat > > D=(floor)D/2; > > S=S-D; > > till D=0 > > From the above logic, figure out which algorithm is followed by 'S' > > 2. How can you divide a triangle, to 5 equal triangles? > > 3. There are 1111 players for a chess tournament, having every game as a > knock out game (a player will > > be out of the tournament if he/she loses a game), how many games need to be > conducted to determine a > winner of the tournament. > > -- > Regards > SAGAR PAREEK > COMPUTER SCIENCE AND ENGINEERING > NIT ALLAHABAD > > -- > 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. > -- 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.
