(用来做笔记,欢迎交流讨论!)
贴上代码:
package com.fei.example.lib;
public class Binary_Search {
//二分查找
public int binary_Search(int[] L, int key) {
int low = 0;
int high = L.length - 1;
int mid;
while (low <= high) {
mid = (low + high) / 2;
if (L[mid] == key) {
return mid;
} else if (L[mid] > key) {
high = mid - 1;
} else {
low = mid + 1;
}
}
return -1;
}
//测试数据
public static void main(String[] args) {
Binary_Search a = new Binary_Search();
int[] array = {2, 5, 9, 10, 13, 15, 19};
int n = 15;
System.out.println(a.binary_Search(array, n));
}
}