**java算法 冒泡排序 选择排序 折半查找**

//选择排序

 

int[] arr = {2,3,5,6,4,7,8,2,5,6};
for(int i = 0; i < arr.length-1; i++){
      for(int j = i + 1; j < arr.length; j++){
             if(arr[i] > arr[j]){
               int temp = arr[i];
               arr[i] = arr[j];
               arr[j] = temp;
             }
      }
}

//冒泡排序

for(int i = 0; i < arr.length; i++){
   for(int j = 0; j <arr.length-i-1; j++){
        if(arr[j] > arr[j+1]){
           int temp = arr[j];
           arr[j] = arr[j+1];
           arr[j+1] = temp;
  }
 }
}

//折半查找

//思想 mid = min + max min = 0; max = length - 1; 前提一个有序的数组
public static int search(int[] arr, int key){
 int min = 0;
 int max = arr.length - 1;
 int mid = 0;
 while(min < max){
    mid = (min + max)/2;
    if(key > arr[mid]){
        min=mid+1;
  }
    if(key < arr[mid]){
        max=mid-1;
  }
    if(key==mid){
        return arr[mid];
  }
 }
}