package .......*;
/**
public class SelectSortDemo1 {
public static void main(String[] args) {
int [] arr = {23,34,12,67,45,789};
bubbleSort(arr);
for(int x = 0; x<arr.length; x++){
System.out.print(arr[x]+",");
}
}
public static void bubbleSort(int [] arr){
//-1是为了避免角标越界
for(int x = 0; x<arr.length-1; x++){
//-x是为了减少比较的次数
for(int y = 0; y<arr.length-1-x; y++){
if(arr[y]>arr[y+1]){
int temp = arr[y+1];
arr[y+1] = arr[y];
arr[y] = temp;
}
}
}
}
}
/**
* 数组之冒泡排序(从小到大)
*
* */
public class SelectSortDemo1 {public static void main(String[] args) {
int [] arr = {23,34,12,67,45,789};
bubbleSort(arr);
for(int x = 0; x<arr.length; x++){
System.out.print(arr[x]+",");
}
}
public static void bubbleSort(int [] arr){
//-1是为了避免角标越界
for(int x = 0; x<arr.length-1; x++){
//-x是为了减少比较的次数
for(int y = 0; y<arr.length-1-x; y++){
if(arr[y]>arr[y+1]){
int temp = arr[y+1];
arr[y+1] = arr[y];
arr[y] = temp;
}
}
}
}
}