java冒泡排序

//冒泡排序
public static void prime(int[] arr) {
//System.out.println("输出数据：");
for (int i = 0; i < arr.length; i++) {
System.out.print(" "+arr[i]);
}
int temp;
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < arr.length-1; j++) {
if(arr[j]>arr[j+1]){
temp=arr[j+1];
arr[j+1]=arr[j];
arr[j]=temp;
}
}
}
System.out.println();
}

 

 

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
//System.out.println("输入数据：");
int [] arr =new int[10] ;
Random r = new Random(1);
for (int i = 0; i < 9; i++) {
//arr[i]=Integer.valueOf(sc.nextInt());
int ran1 = r.nextInt(100);
//System.out.println(ran1);
arr[i]=ran1;
}

prime(arr);
System.out.println("排序后输出数据：");
for (int i = 0; i < arr.length; i++) {
System.out.print(" "+arr[i]);
}
}