Fixture Generating Algorithm Easiest Describe with Drawing
I will explain how to create a fixture algorithm regardless of the programming language. But if you want to see how I write in Java, you can check my GitHub link. So, let's start. When we are building a fixture-generating algorithm, we have to know two basic things; The teams will match one time or two times? How many teams are there? (n) We can get the answers that we need with the above questions. How many teams will match every round? : All teams can bisect. (n/2) How many rounds will there be? - If teams will match just once: All teams minus one. (n-1) - If teams will match twice: All teams minus one and multiplied by two. ((n-1) x 2) The last question means; What will be the size of our match list? When we create a loop, we will use just (n-1) and will not use the second one (n-1)x2 The Algorithm with Drawing For example, let's think at first algorithm had that below teams; Then we can say we have 4 teams, which means n = 4 so in each round, the teams will match 4/2 = 2 t