package test.main;
/**
* @author tien
* @version Create Time:May 3, 2011 4:52:06 PM
*/
public class BinarySearch {
/**
* @param args
*/
public static void main(String[] args) {
int[] data={1,2,3,4,5,6,8,10,12,13,45,56,69};
int index = binarySearch(data, 1, 0, data.length-1);
System.out.println(index);
}
/**
*二分查找特定整数在整型数组中的位置(递归)
*@paramdataset
*@paramdata
*@parambeginIndex
*@paramendIndex
*@returnindex
*/
public static int binarySearch(int[] dataset, int data, int beginIndex,
int endIndex) {
int midIndex = (beginIndex + endIndex) / 2;
if (data < dataset[beginIndex] || data > dataset[endIndex]
|| beginIndex > endIndex)
return -1;
if (data < dataset[midIndex]) {
return binarySearch(dataset, data, beginIndex, midIndex - 1);
} else if (data > dataset[midIndex]) {
return binarySearch(dataset, data, midIndex + 1, endIndex);
} else {
return midIndex+1;
}
}
/**
*二分查找特定整数在整型数组中的位置(非递归)
*
* @paramdataset
*@paramdata
*@returnindex
*/
public static int binarySearch(int[] dataset, int data) {
int beginIndex = 0;
int endIndex = dataset.length - 1;
int midIndex = -1;
if (data < dataset[beginIndex] || data > dataset[endIndex]
|| beginIndex > endIndex)
return -1;
while (beginIndex <= endIndex) {
midIndex = (beginIndex + endIndex) / 2;
if (data < dataset[midIndex]) {
endIndex = midIndex - 1;
} else if (data > dataset[midIndex]) {
beginIndex = midIndex + 1;
} else {
return midIndex;
}
}
return -1;
}
}
BinarySearch 二分法查询
最新推荐文章于 2017-05-20 11:13:49 发布