/**
- @author:小陈
- @time: 10-17
*/
import org.omg.Messaging.SYNC_WITH_TRANSPORT;
import java.util.Scanner;
import java.util.Random;
public class 冒泡排序 {
public static void main(String[] args) {
Random rand=new Random();
Scanner input=new Scanner(System.in);
int []nums=new int[10];
for (int i=0;i<10;i++){
nums[i]=rand.nextInt(100);//生成一个待排序的随机数数组
System.out.print(nums[i]+“\t”); //为方便观察,打印数组
}
System.out.println();
//外循环控制轮数
int len=nums.length;
for (int i=0;i<len-1;i++){ //比较的轮数等于数列的长度-1
//内循环控制
for (int j=0;j<len-1-i;j++){
if (nums[j]>nums[j+1]){
nums[j]=nums[j]+nums[j+1];
nums[j+1]=nums[j]-nums[j+1];
nums[j]=nums[j]-nums[j+1];
}
}
}
for (int n:nums){ //遍历输出
System.out.println(n);
}
}
}