二分查找及其bian'zhong

1、二分查找

• java

  public class binarySearch {
  	public static boolean binarysearch(int[] array,int target) {
  		int low=0;
  		int high=array.length;
  		
  		while(low<=high) {
  			int mid = (low+high)/2;
  			if(array[mid]==target) {
  				return true;
  			}else if(array[mid]<target) {
  				low = mid+1;
  			}else {
  				high=mid-1;
  			}
  		}
  		return false;
  			
  	}
  		
  	public static void main(String[] args) {
  		int[] arr= {2,8,13,24,56,78,89,100};
  		binarySearch bs=new binarySearch();
  		int tar=16;
  		boolean res;
  		res = bs.binarysearch(arr, tar);
  		System.out.println(res);
  	}
  
  }

   

• python

  def binarySearch(arr,target):
      if len(arr)<=0:
          return False
      low,high = 0,len(arr)-1
  
      while low<=high:
          mid = (low+high)//2
          if arr[mid]==target:
              return True
          elif arr[mid]<target:
              low = mid+1
          else:
              high = mid -1
  
      return False