package com.Test.Sort;
/*
* author:Tammy Pi
* function:二分查找
*/
public class BinarySearch {
public static void binarySearch(int[] a,int x,int i,int j){
if(i<=j){
int p = (i+j)/2;
if(a[p]==x){
System.out.println("位置为:"+p);
return;
}else if(a[p]<x){
binarySearch(a,x,p+1,j);
}else if(a[p]>x){
binarySearch(a,x,i,p-1);
}
}
}
public static void main(String[] args){
int[] a= {1,2,3,4,5};
binarySearch(a,4,0,4);
}
}
二分查找
最新推荐文章于 2022-11-11 15:33:31 发布