Ya tournament tree is fine, you can even check it on
http://www.geeksforgeeks.org/archives/11556
To decide a winner among N people, ( n-1 ) people should loose. So N-1
games will decide.
On Mon, Apr 9, 2012 at 12:45 AM, SAMM somnath.nit...@gmail.com wrote:
This can be done using Tournament
Hi Team,
I have the following question. Could any of you answer this?
*Interview Question:*
*How many games you will conduct to decide a winner for N players.
Visualize in terms of a Data Structure. *
Is there any mathematical calculation to decide the winner among N-players?
Game is 1 against
This can be done using Tournament Tree ...
PLzz refer wiki or http://www.geeksforgeeks.org/archives/11556 ... This
will surely help ..
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
