查找算法（线性查找，二分查找）

//线性查找
package MyJava.SuanFa;

import com.sun.org.apache.xerces.internal.xs.ItemPSVI;

public class ArrayTest2 {
    public static void main(String[] ags){
        String[] array1 = new String[]{"aa","bb","cc","dd","ee"};
     String dest = "oo";
     boolean isFlag = true;
     for (int i =0 ;i< array1.length;i++){
         if (dest.equals(array1[i])){
             System.out.println("找到了"+i);
             isFlag = false;
             break;
         }

     } if (isFlag){
            System.out.println("很抱歉，没找到");
        }
   }
}

//二分查找（折半查找）
//较常用，前提：使用二分查找的前提是有序
package MyJava.SuanFa;

public class ArrytTest {
    public static void main(String[] ags){
        int [] arr = new int[]{-100,-35,-3,1,28,48,90,188,2000,88888,9999999};
        int demo = 9999999;
        int head = 0;
        int end = arr.length-1;
        boolean isFlag = true;

        while (head<=end){
            int mode2= (head + end)/2;
            if (demo == arr[mode2]){
                System.out.println("找到了: "+mode2);
                isFlag = false;
                break;
                }
            else if (demo>arr[mode2]){
                    head = mode2+1;
            }
            else {
                end = mode2-1;
            }
        }

        if (isFlag){
            System.out.println("没有");
        }

    }
}