Ready to sort
tournament ● Active ● Sorted
Nodes appear as the algorithm builds its structure.

Statistics

Status Idle
Operations 0 / 0

Controls

50
5x

Summary

A tournament tree records the smaller competitor at each internal node. After outputting the champion, only its path to the root must be replayed.

How it Works

  • Build a complete winner tree over input positions.

  • Output the winner at its root.

  • Remove its leaf and replay matches along that leaf’s path.