public class Test2 {
public static void main(String[] args) {
//定义数组
int[] arr = {2,16,-1,22,13};
//打印排序前数组
System.out.println("排序前:");
for(int i=0;i<=arr.length-1;i++) {
System.out.print(arr[i]+" ");
}
System.out.println();
//排序
for(int i=0;i<arr.length-1;i++) {
for(int j=0;j<arr.length-1-i;j++){
//定义左、右边界
int left = arr[j];
int right = arr[j+1];
if(left>right){
arr[j] = right;
arr[j+1] = left;
}
}
}
System.out.println("排序后:");
for (int i:arr) {
System.out.print(i+" ");
}
}
}
java面试题(1)冒泡排序
最新推荐文章于 2022-07-26 17:39:57 发布