Java实现折半查找(二分查找)的递归和非递归算法

转　：　http://wintys.blog.51cto.com/425414/94051
/**
*名称:BinarySearch
*功能:实现了折半查找(二分查找)的递归和非递归算法.
*说明:
*     1、要求所查找的数组已有序,并且其中元素已实现Comparable<T>接口,如Integer、String等.
*    2、非递归查找使用search();,递归查找使用searchRecursively();
*
*本程序仅供编程学习参考
*
*@author:   Winty
*@date:     2008-8-11
*@email:    wintys@gmail.com
*/
class BinarySearch<T extends Comparable<T>> {
    private T[]  data;//要排序的数据
    public BinarySearch(T[] data){
        this.data = data;
    }
    public int search(T key){
        int low;
        int high;
        int mid;
        if(data == null)
            return -1;
        low = 0;
        high = data.length - 1;
        while(low <= high){
            mid = (low + high) / 2;
            System.out.println("mid " + mid + " mid value:" + data[mid]);///
            
            if(key.compareTo(data[mid]) < 0){
                high = mid - 1;
            }else if(key.compareTo(data[mid]) > 0){
&n