JAVA数组排序

/冒泡排序*/

//创建一个数组
int[] arr = {12,21,23,34,23,133,43,2,9,1};
System.out.println(“未排序的数组：”);
//for循环遍历数组
System.out.print("[");
for (int i = 0; i < arr.length; i++) {
if (i ==arr.length-1){
System.out.println(arr[i]+"]");
}else {
System.out.print(arr[i]+",");
}
}
//创建临时变量
int temp = 0;
for (int i = 0; i < arr.length; i++) {
for (int j =i+1;j<arr.length;j++){
//比较两个元素的值，如果满足条件，执行下面的语句
if (arr[i]>arr[j]){ //将arr【i】和arr【j】的值进行交换，将小的值给arr【i】
temp = arr[i]; //将arr【i】的值赋值给临时变量temp
arr[i] = arr[j]; //将两者中较小的值赋值给arr【i】
arr[j] = temp; //将temp中暂存的较大值赋值给arr【j】，完成一次交换
}
}
}

  System.out.println("冒泡排序后的数组：");
    System.out.print("[");
    for (int i =0; i< arr.length;i++){
        if (i == arr.length-1){
            System.out.println(arr[i]+"]");
        }else {
            System.out.print(arr[i]+", ");
        }
    }

/选择排序/
//定义并声明数组
int[] arr = {21,2,14,32,65,9,123,345};
System.out.println(“未排序的数组：”);
Util.printArray(arr);
int temp = 0;
for (int i =0; i<arr.length;i++){
int index = i;
for (int j = i+1; j < arr.length; j++) {
if (arr[index]>arr[j]){
index = j;
}
}
if (index != i){
temp =arr[i];
arr[i] = arr[index];
arr[index] = temp;
}
}
System.out.println(“排序后的数组：”);
//遍历