Sorting $8$ Players in $24$ Hours: Is it Possible?

  • Context: MHB 
  • Thread starter Thread starter mathmari
  • Start date Start date
  • Tags Tags
    Sorting
Click For Summary
SUMMARY

The discussion centers on sorting 8 players within a 24-hour timeframe using a series of games, each lasting one hour. The players were ranked as follows: P1 (1st), P2 (2nd), P3 (3rd), P4 (4th), P5 (5th), P6 (6th), P7 (7th), and P8 (8th) in a total of 16 hours. The sorting process involved multiple rounds of games to determine the rankings, with specific time allocations for each player’s evaluation. The question of whether this method resembles the Mergesort algorithm was raised.

PREREQUISITES
  • Understanding of tournament-style sorting methods
  • Basic knowledge of player ranking systems
  • Familiarity with time management in competitive settings
  • Concept of algorithmic sorting techniques, particularly Mergesort
NEXT STEPS
  • Research tournament-style sorting algorithms
  • Study the Mergesort algorithm and its applications in sorting
  • Explore time complexity analysis in competitive scenarios
  • Investigate alternative player ranking methods in sports
USEFUL FOR

This discussion is beneficial for sports analysts, game organizers, and algorithm enthusiasts interested in efficient player ranking and sorting methodologies.

mathmari
Gold Member
MHB
Messages
4,984
Reaction score
7
Hey! :o

We have $8$ players and we want to sort them in $24$ hours.
There is one stadium. Each game lasts one hour.
In how many hours can we sort them?? (Wondering)

I thought that we could it as followed:

$$\boxed{P1} \ \boxed{P2} \ \boxed{P3} \ \boxed{P4} \ \boxed{P5} \ \boxed{P6} \ \boxed{P7} \ \boxed{P8} \\ \ \ \ \ \boxed{P1} \ \ \ \ \ \ \ \ \ \boxed{P3} \ \ \ \ \ \ \ \ \boxed{P5} \ \ \ \ \ \ \ \ \ \ \ \boxed{P7} \\ \ \ \ \ \ \ \ \ \ \ \ \ \ \boxed{P1} \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \boxed{P5} \\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \boxed{P1}$$

So, the best player is $P1$.
These games took place in $7$ hours.

We know that $P5$ is the best player among the players $P5$, $P6$, $P7$ and $P8$.

$$\boxed{P2} \ \boxed{P3} \ \boxed{P4} \ \boxed{P5}\\ \ \ \ \ \ \ \ \boxed{P2} \ \ \ \boxed{P5} \\ \ \ \ \ \ \ \ \ \ \ \ \ \boxed{P2}$$

So, the second best player is $P2$.
These games took place in $3$ hours.

$$\boxed{P3} \ \boxed{P4} \ \boxed{P5}\\ \ \ \ \ \ \boxed{P3}\ \ \ \ \boxed{P5} \\ \ \ \ \ \ \ \ \ \ \ \ \boxed{P3}$$

So, the third best player is $P3$.
These games took place in $2$ hours.

$$\boxed{P4} \ \boxed{P5}\\ \ \ \ \ \boxed{P4}$$

So, the $4^{th}$ best player is $P4$ and the $5^{th}$ best player is $P5$.
This game took place in $1$ hour.

$$\boxed{P6} \ \boxed{P7} \ \boxed{P8}\\ \ \ \ \ \ \boxed{P6}\ \ \ \ \boxed{P8} \\ \ \ \ \ \ \ \ \ \ \ \ \boxed{P6}$$

So, the $6^{th}$ best player is $P6$.
These games took place in $2$ hours.

$$\boxed{P7} \ \boxed{P8}\\ \ \ \ \ \boxed{P7}$$

So, the $7^{th}$ best player is $P7$ and $8^{th}$ best player is $P8$.
This game took place in $1$ hour.

Therefore, we sorted the players $P1 \geq P2 \geq P3 \geq P4 \geq P5 \geq P6 \geq P7 \geq P8$ in $7+3+2+1+2+1=16$ hours.

Is it correct?? (Wondering)
 
Technology news on Phys.org
Is it maybe an application of Mergesort?? (Wondering)
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 18 ·
Replies
18
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K