查找 与 二分法查找

查找 与 二分法查找

//查找  （或者搜索）
//线性搜索
String []arr=new String[]{"JJ","DD","MM","BB","GG","AA"};
String dest="BB";
  boolean isfalg=true;
for (int i = 0; i < arr.length; i++) {
    if (dest.equals(arr[i])) {
        System.out.println("找到了指定的元素，位置为：" + i);
        isfalg = false;
        break;
    }

    }
    if (isfalg) {
        System.out.println("很遗憾你，没有找到");

---

二分法查找

前提 ，所要查找的的数组必须是有序的

int[]arr2= new  int[]{1,2,2,555,64,7,45,6,7,1,2,4};
    int dest1=555;  //需要查找的值
 int head =0;  //初始的首索引
int end=arr2.length-1;      //初始的末索引值
 boolean isfalg1=true;

while (head<=end){
    int middle=(head+end)/2;
    if (dest1==arr2[middle]){
        System.out.println("找到了指定的数值"+dest1);
        isfalg1=false;
         break;
    }else if (arr2[middle]> dest1) {
        end = middle - 1;
    }else  if (arr2[middle]<dest1){
        head=middle+1;
    }
}