@[toc]冒泡排序
共进行n-1次循环
每次循环时相邻的两个元素进行比较
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;
}
}
}