package wanlin;
public class arr_lian2 {
public static void main(String[] args){
int[] arr = {2,32,23,11,1,6,67,86,88,66,55,65,31};
int temp = 0,i=0;
System.out.print("[");
for(i=0;i<arr.length;i++){
// System.out.print(arr[i]);
if(i != arr.length-1)
System.out.print(arr[i]+",");
else
System.out.print(arr[i]+"]\n");
}
for(i=0;i<arr.length-1;i++){
for(int j=i+1;j<arr.length;j++){
if(arr[i]>arr[j]){
temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}
for(i=0;i<arr.length;i++){
System.out.print(arr[i]+" ");
}
}
}
java数组、排序问题1
最新推荐文章于 2017-07-24 16:45:43 发布