递归与分支2

System.out.print(schedule[i][j] + " ");
}
System.out.println();
}
}
publicstaticvoid merge_schedule(int[] player, int[][] schedule, intlow, inthigh){
System.out.println("排序后：");
for(inti=0;i<a.length;i++){
System.out.print(a[i] + " ");
}
System.out.println();
}
publicstaticvoid quickSort(ints[], intl, intr)
for(l=1;j<=high-low;j++, l++)
{
schedule[i][j] = schedule[k][l];
}
}
return;
}
publicstaticvoid make_schedule(int[] player, int[][] schedule, intlow, inthigh){
{
if (l<r)
{
inti = l, j = r, x = s[l];
while (i<j)
{
while(i<j&&s[j] >= x)
j--;
if(i<j)
s[i++] = s[j];
while(i<j&&s[i] <x)
import java.util.Scanner;
publicclass Schedule {
publicstaticvoid main(String[] args){
Scanner scanner =new Scanner(System.in);
intplayer_num;
if(low == high) return;
intmid = (low + high) / 2;
make_schedule(player, schedule, low, mid);
make_schedule(player, schedule, mid+1, high);
inti, k, l; //临时变量
intj; //选手i已安排好对手的天数加一
for(i=low, k=high;i<=high&&k>=low;i++, k--)
{
j = (high - low + 1) / 2;
schedule[i][j++] = k;
System.out.print("输入选手人数：");
player_num = scanner.nextInt();
scanner.close();
int[] player = newint[player_num+1];
int[][] schedule = newint[player_num+1][player_num];
一、实验题目
1.设有n=2k个运动员要进行网球循环赛。现要设计一个满足以下要求的比赛日程表：
（1）每个选手必须与其他n-1个选手各赛一次；
（2）每个选手一天只能赛一次；
（3）循环赛一共进行n-1天。
2.利用快速排序算法将数组｛4，8，3，7，1，5，6，2｝进行快速排序。
二、算法实现
1.循环赛日程表
i++;
if(i<j)
s[j--] = s[i];
}
s[i] = x;
quickSort(s, l, i - 1);
quickSort(Hale Waihona Puke , i + 1, r);
}
}
}
make_schedule(player, schedule, 1, player_num);
for(inti=1;i<=player_num;i++){
System.out.print(i + ":");
for(intj=1;j<player_num;j++){
merge_schedule(player, schedule, low, high);
return;
}
}
2.快速排序
publicclass QuickSort {
publicstaticvoid main(String[] args) {
int[] a = {4, 8, 3, 7, 1, 5, 6, 2};
System.out.println("排序前：");
for(inti=0;i<a.length;i++){
System.out.print(a[i] + " ");
}
System.out.println();
quickSort(a, 0, a.length-1);