Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

#32 Single-Elimination Tournament #12

Open
ThisIsDarrenHouse opened this issue Dec 19, 2016 · 0 comments
Open

#32 Single-Elimination Tournament #12

ThisIsDarrenHouse opened this issue Dec 19, 2016 · 0 comments
Assignees
@NickWarm
Milestone
2017.1.9

Comments

@ThisIsDarrenHouse
Copy link
Collaborator

ThisIsDarrenHouse commented Dec 19, 2016 •
edited
Loading

In a single-elimination tournament—such as the tennis Grand Slam
championships—every losing player is immediately eliminated from the
subsequent rounds of play until a single winner is determined. If such a
tournament starts with n players, determine the following:
(a) What is the total number of matches needed to get a winner?
(b) How many rounds are there in such a tournament?
(c) How many more matches need to be played to determine the secondbest
player based on the information produced by the tournament?
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@NickWarm NickWarm

Labels
None yet
Projects
None yet
Milestone
2017.1.9
Development

No branches or pull requests
2 participants
@NickWarm @ThisIsDarrenHouse