Sorting with Bitonic Sort | Sorting Algorithms Visualized

Bitonic Sort description: Bitonical Sort starts by grouping numbers in 2 groups, every group's top value is moved either to the top or bottom. Next, those groups are compared with a neighbor to sort groups of 4 by diving values by size recursively.Bitonic Sort example: You are running a 64-player single elimination tournament to find how good everyone is at a game. In the bracket, you start with 32 groups of 2. After a winner is decided, the winners fight another group. Enough games take place between the 2 groups to know the order of all 4 people. These battles happen with every group until a true winner is decided.