winner.out

来自「data struct algorithm and application in」· OUT 代码 · 共 19 行

Enter number of players, between 8 and 20
Enter player values
The winner tree is
size = 10 LowExt = 4 Offset = 15
Winner tree pointers are
10 3 10 3 5 8 10 1 3 
Changed player 2 to zero, new tree is
size = 10 LowExt = 4 Offset = 15
Winner tree pointers are
2 2 10 2 5 8 10 2 3 
Changed player 3 to -1, new tree is
size = 10 LowExt = 4 Offset = 15
Winner tree pointers are
3 3 10 3 5 8 10 2 3 
Changed player 7 to 2, new tree is
size = 10 LowExt = 4 Offset = 15
Winner tree pointers are
3 3 10 3 5 7 10 2 3