线性查找和二分查找 Java

Java 线性查找和二分查找

public class Test{
    public static void main{}
    //二分查找
    public static void binarysearch(int[] binarysearch,int searchnum) {
    	// 遍历数组
        System.out.print("binary search:");
        for (int i : binarysearch) {
            System.out.print(i+" ");
        }
        System.out.println();


        int head = 0;
        int end = binarysearch.length-1;
        boolean is_find = true;
        while (head <= end) {
            int mid = (head + end) / 2;
            if (binarysearch[mid] < searchnum) {
                head = mid + 1;
            } else if (binarysearch[mid] > searchnum) {
                end = mid -1;
            } else {
                System.out.println("找到指定的元素，索引为："+mid);
                is_find = false;
                break;
            }
        }
        if (is_find) {
            System.out.println("未找到");
        }
    }

    //线性查找
    public static void linesearch(int[] arr, int number) {
    	// 遍历数组
        for (int i : arr) {
            System.out.print(i+" ");
        }
        System.out.println();


        boolean is_Find = true;
        for (int i=0; i<arr.length; i++) {
            if (number == arr[i]) {
                System.out.println(“找到指定的元素，索引为：”+i);
                is_Find = false;
                break;
            }
        }
        if (is_Find) {
            System.out.println("未找到");
        }
    }
}