三种有序查找方式

二分查找

package 查找;

public class Binarysearch {
	public static void main(String[] args) {
		int[] a=new int[]{2,5,6,8,67,58,46};
		System.out.println(Binarysearch.search(a,58));
	}
	public static int search(int a[],int key) {
		int low=0;
		int high=a.length-1;
		while(low<=high) {
			int mid=(low+high)/2;
			if(key>a[mid]) {
				low=mid+1;
			}
			else if(key<a[mid]) {
				high=mid-1;
			}
			else {
				return mid;
			}
		}
		return 0;
	}
}

插值查找
不再以每次二分之一作为划分数据的依据。每次查找可能以四分之一或其他为依据，从而提高查找效率，适用于数据分布均匀的情况

package 查找;

public class InterpolationSearch {
	public static void main(String[] args) {
		int[] a=new int[]{2,5,6,8,46,58,67};
		System.out.println(InterpolationSearch.search(a,58));
	}
	public static int search(int a[],int key) {
		int low=0;
		int high=a.length-1;
		while(low<=high) {
			int mid=low+(high-low)*(key-a[low])/(a[high]-a[low]);//与二分查找的唯一不同点
			if(key>a[mid]) {
				low=mid+1;
			}
			else if(key<a[mid]) {
				high=mid-1;
			}
			else {
				return mid;
			}
		}
		return 0;
	}
}

斐波那契查找
以斐波那契数列的值，作为划分查找中点的依据。
这里需要用到java中的Arrays.copyof()方法

package 查找;

import java.util.Arrays;

public class FibonacciSearch {
	public static void main(String[] args) {
		int[] a=new int[]{2,5,6,8,46,58};
		System.out.println(InterpolationSearch.search(a,58));
	}
	public static int Fibonacci(int n) {
		if(n==0) {
			return 0;
		}
		else if(n==1) {
			return 1;
		}
		else{
			return Fibonacci(n-1)+Fibonacci(n-2);
		}
	}
	public static int search(int a[],int key) {
		int low,high,k,mid;
		low=0;
		high=a.length-1;
		k=0;
		while(a.length>Fibonacci(k)-1) {
			k++;
		}
		int[] temp=Arrays.copyOf(a, Fibonacci(k));
		for(int i=high;i<temp.length;i++) {//填充数组
			temp[i]=a[high];
		}
		while(low<=high) {
			mid=low+Fibonacci(k-1)-1;
			if(key<temp[mid]) {
				high=mid-1;
				k--;
			}
			else if(key>temp[mid]) {
				low=mid+1;
				k=k+2;
			}
			else {
				if(mid<=a.length-1) {
					return mid;
				}
				else {
					return a.length-1;
				}
			}
		}
		return 0;
	}
}