[color=blue]/**
*
*
* 项目名称:Demo
* 类名称:BinarySearch
* 类描述: 折半查找,二分查找。要求数组有序,从数组的中间进行比较,依次缩小范围* 创建人:k0441
* 创建时间:2011-10-9 下午06:40:23
* @version
*
*/[/color]public class BinarySearch {
public static void main(String[] args) {
int[] i = new int[200];
for(int a=0;a<i.length;a++){
i[a]=a;
}
System.out.println(search(i, 199));
}
public static int search(int[] i,int searchWord){
int start=0;
int middle=0;
int end=i.length;
if((end>start)&&(searchWord>=i[0])&&(searchWord<=i[i.length-1])){//数组长度大于1
middle=(start+end)/2;
while (i[middle]!=searchWord) {
System.out.println(i[middle]);
if(i[middle]>searchWord){//数组中间的数大于关键字
end=middle-1;//数组截取的终点在: 中间-1
middle=(start+end)/2;
}else {
start=middle+1;//数组街区的起点在: 中间+1
middle=(start+end)/2;
}
}
System.out.println("find out");
return i[middle];
}else {
System.out.println("error");
return 0;
}
}
}
*
*
* 项目名称:Demo
* 类名称:BinarySearch
* 类描述: 折半查找,二分查找。要求数组有序,从数组的中间进行比较,依次缩小范围* 创建人:k0441
* 创建时间:2011-10-9 下午06:40:23
* @version
*
*/[/color]public class BinarySearch {
public static void main(String[] args) {
int[] i = new int[200];
for(int a=0;a<i.length;a++){
i[a]=a;
}
System.out.println(search(i, 199));
}
public static int search(int[] i,int searchWord){
int start=0;
int middle=0;
int end=i.length;
if((end>start)&&(searchWord>=i[0])&&(searchWord<=i[i.length-1])){//数组长度大于1
middle=(start+end)/2;
while (i[middle]!=searchWord) {
System.out.println(i[middle]);
if(i[middle]>searchWord){//数组中间的数大于关键字
end=middle-1;//数组截取的终点在: 中间-1
middle=(start+end)/2;
}else {
start=middle+1;//数组街区的起点在: 中间+1
middle=(start+end)/2;
}
}
System.out.println("find out");
return i[middle];
}else {
System.out.println("error");
return 0;
}
}
}