二分查找算法-java
题目:
在一个有序数组中查找给定值得下标
其中有两个前提,一是顺序存储结构,二是存储结构已经是排好序的。
给定前提:
int[] array = new int[]{1, 3, 5, 12, 18, 23, 24, 50};
int num = 50;
int left = 0, right = array.length - 1;
先看看直接用循环的方式:
int index = -1;
int middle;
while (left <= right) {
middle = (left + right) / 2;
if (array[middle] == num) {
index = middle;
break;
} else if (num < array[middle]) {
right = middle - 1;
} else {
left = middle + 1;
}
}
// index就是下标,如果为-1表示未找到
System.out.println(index);
再看看递归的方式:
private static int indexOf(int[] array, int num, int left, int right) {
if (num < array[left] || num > array[right] || left > right) {
return -1;
}
int middle = (left + right) / 2;
if (array[middle] == num) {
return middle;
} else if (num < array[middle]) {
right = middle - 1;
} else {
left = middle + 1;
}
return indexOf(array, num, left, right);
}
参考:http://blog.csdn.net/jiandanfeng2/article/details/6525193