冒泡排序
package com.liu;
public class MaoPao {
public static void main(String[] args) {
int arr[]= {2,45,94,1};
int num;
for(int j=0;j<arr.length-1;j++) {
for(int i=0;i<arr.length-1;i++) {
if(arr[i]>arr[i+1]) {
num=arr[i];
arr[i]=arr[i+1];
arr[i+1]=num;
}
}
}
for(int i=0;i<arr.length;i++) {
System.out.println(arr[i]);
}
}
}