二分查找与斐波那契查找

数据结构–查找

二分查找

1. 方法一：轴点取中点，逐步递归。算法时间复杂度O(log[n])。主要思路如下图：
   

<pre>
public class LinearRecur {
   
	public static void main(String[] args) {
   
		int[] b = {
   2,6,6,9,10,10};
		int low = 0;
		int high = b.length; 
		int index = 0;
		index = binarySearch(b, low,high, 2);
		System.out.print(index);
	}
	public static int binarySearch(int[] array, int low, int high, int num) {
   
		if(high - low == 1) {
   
			if (array[low] == num) {
   
				return low;