I am trying to find out if there is any generic way to find out first to nth best player in a tournament if n is less than the square root of input size i.e. 5 best players in the sample size of 25 players?
I thought of using below approach to find out 2 best players.
So for finding out the 3rd best player we can use the same approach i.e. players lost again best best player + players lost against 2nd best player should be again played against each other to find out the 3rd best player.
Am I right if this would be the minimum number of comparisons to get 3rd best player?
Or should I divide the players in square root of input size and then play in groups as this?
When two players play better player always wins. You can design your own tournament strategy to figure out the best