JAVASE基础（排序插入法和二分查找法）

eg：

package com.lhs;
//插入排序算法
public class Test11 {
    public static void main(String[] args) {
        int[] nums = {32,45,23,56,59,67,35,46};
        //控制比较的轮数
        for (int i = 1; i < nums.length; i++) {
            int temp = nums[i];//记录操作数
            int j =0;
            for (j=i-1; j >=0; j--) {
                if (nums[j]>temp){
                    nums[j+1] = nums[j];
                }else {
                    break;
                }
            }
            if (nums[j+1]!=temp){
                nums[j+1] = temp;
            }
        }
        //输出结果
        for (int i = 0; i < nums.length; i++) {
            int n = nums[i];
            System.out.print(n+" ");
        }
    }
}

package com.lhs;
//二分法查找（折半查找）：前提是已经排好了顺序的数组中
/*
将要查找的数，与数据中的元素进行比较，若中间元素值比自己大，
去掉右边部分，去左边查找，反之去右边查找
以此类推，直到找到为止
 */
public class Test12 {
    public static void main(String[] args) {
        int[] num = {23,32,35,45,46,56,59,67};
        int index = binarySearch(num,56);
        System.out.println("您查找的数在数组中第"+(index+1)+"个");
    }
    public static int binarySearch(int[] num,int key){
        int start = 0;
        int end = num.length-1;

        while (start<=end){
            int middle = (start+end)/2;
            if (num[middle]>key){
                end = middle -1;
            }else if (num[middle]<key){
                start = middle+1;
            }else {
                return middle;
            }
        }
        return -1;
    }

}