自己编写的适用于单循环比赛的贝格尔编排法代码,若有可改进之处,望高手指正
import java.util.Scanner;
public class BergerTest {
public static void main(String[] args) {
// TODO Auto-generated method stub
BergerTest ber = new BergerTest();
System.out.println("输入队伍数量:");
Scanner cin = new Scanner(System.in);
int team_Num = cin.nextInt();
if((team_Num&0x1)!=0){
team_Num++;
}
int[] team_arr = new int[team_Num];
ber.init(team_arr, team_Num);
int flag = team_Num-1;//最后一直队伍或者空白队伍的标志
int walk = team_Num/2 -1;//移动步长
for(int i= 0; i< team_Num-1; i++){
System.out.println("第"+(i+1)+"轮:");
if(i>0){
flag = ber.exchangFlag(team_arr, team_Num, flag);
ber.move(team_arr, team_Num, flag, walk);
}
ber.display(team_arr, team_Num);
}
}
public void display(int[] arr,int len){
for(int i = 0; i < len/2; i++
贝格尔编排法代码
最新推荐文章于 2022-10-05 13:17:03 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)