代码:
package com.lianxiti;
import java.lang.reflect.Array;
public class lianxiti01 {
public static void main(String[] args) {
System.out.println("原数组:");
//用户定义数组;
int [] array = new int[]{1,3,-1,5,-2};
//输出以上数组的数字;
for (int i = 0; i < array.length; i++) {
System.out.print(array[i]+"\t");
}
//换行;
System.out.println("\n");
System.out.println("排序后数组为:"+"\t");
int Array[] = new int[5];
int top=0;
//外层循环控制比较的轮数,每论选出当前论的最大数;
//内层循环控制每轮的比较次数;
for (int i = 0; i < array.length-1; i++) {
for (int j = 0; j < array.length-1-i; j++) {
if(array[j]>array[j+1]){
top = array[j];
array[j] = array[j+1];
array[j+1] = top;
}
}
}
//打印输出;
for (int i = 0; i < array.length; i++) {
System.out.print(array[i]+"\t");
}
}
}