//排序算法 冒泡排序
class MaoPao{
public static void printArray(int[] arr){
System.out.print("[");
/*for(int i=0;i<arr.length;i++){
if(i==arr.length-1)
System.out.print(arr[i]);
else
System.out.print(arr[i]+",");
}
System.out.println("]");*/
for(int i:arr)
System.out.print(i+",");
System.out.print("\b]");
}
public static void buubleSort(int [] arr){
for(int i=0;i<arr.length-1;i++){
int count=0;
for(int j=0;j<arr.length-1-i;j++){
if(arr[j]>arr[j+1]){
int temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
count++;
}
}
if(count==0) break;
}
}
public static void main(String[] args){
int[] arr={56,89,65,26,99,16,32};
System.out.print("排序前:");
printArray(arr);
buubleSort(arr);
System.out.print("排序后:");
printArray(arr);
}
}
class MaoPao{
public static void printArray(int[] arr){
System.out.print("[");
/*for(int i=0;i<arr.length;i++){
if(i==arr.length-1)
System.out.print(arr[i]);
else
System.out.print(arr[i]+",");
}
System.out.println("]");*/
for(int i:arr)
System.out.print(i+",");
System.out.print("\b]");
}
public static void buubleSort(int [] arr){
for(int i=0;i<arr.length-1;i++){
int count=0;
for(int j=0;j<arr.length-1-i;j++){
if(arr[j]>arr[j+1]){
int temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
count++;
}
}
if(count==0) break;
}
}
public static void main(String[] args){
int[] arr={56,89,65,26,99,16,32};
System.out.print("排序前:");
printArray(arr);
buubleSort(arr);
System.out.print("排序后:");
printArray(arr);
}
}