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

  • MHB
  • Thread starter mathmari
  • Start date
  • Tags
    Sorting
In summary, the conversation discusses sorting 8 players in 24 hours by playing games in a stadium, with each game lasting 1 hour. The participants suggest using a method similar to Mergesort, with the best player determined in 7 hours and the remaining players sorted in 3, 2, 1, 2, 1 hours respectively. Thus, it is possible to sort the players in a total of 16 hours. The participants also question if this method is correct and if it could be an application of Mergesort.
  • #1
mathmari
Gold Member
MHB
5,049
7
Hey! :eek:

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
  • #2
Is it maybe an application of Mergesort?? (Wondering)
 

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

Can all 8 players be sorted in 24 hours?

Yes, it is possible to sort all 8 players in 24 hours.

How is the sorting process done?

The sorting process can be done in various ways, such as using a round-robin tournament format, a single-elimination bracket, or a double-elimination bracket.

Is there a specific order in which the players must be sorted?

No, there is no specific order in which the players must be sorted. The sorting process can be done randomly or based on a predetermined ranking system.

Can the sorting process be completed in less than 24 hours?

Yes, it is possible to complete the sorting process in less than 24 hours, depending on the chosen sorting method and the efficiency of the organizers.

What happens if there is a tie during the sorting process?

If there is a tie between two or more players, a tiebreaker round can be held to determine the final ranking. This may extend the sorting process beyond 24 hours.

Similar threads

Back
Top