javaSe算法之冒泡排序

package test;


import java.util.Arrays;
/**
 *  冒泡排序
 * @author M
 *
 */
public class MaoPao {
public static void main(String[] args) {
int [] arr={1,2,8,9,4,6,5,7};
for (int i = 0; i < arr.length-1; i++) {
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;
}
}
}
System.out.println(Arrays.toString(arr));
}
}