Java面试题：二分查找、冒泡排序

            //二分查找
    private static int binarySearch(int[] arr, int key) {
int min = 0;
int max = arr.length - 1;
int mid = (max + min)/2;
while(min <= max) {
if(arr[mid] < key) {
min = mid + 1;
}else if(arr[mid] > key) {
max = mid - 1;
}else {
return mid;
}
mid = (max + min)/2;
}
return -1;
}


//冒泡排序
private static void maoPao() {
int[] arr = {3,2,15,1,2,9,88,0,97};

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;
}
}
}
for(Integer n : arr) {
System.out.print(n + " ");
}
}