Java實現三種常用的尋找演算法(順序查尋找，折半尋找，二叉排序樹尋找)

標籤：

public class Search {    public class BiTreeNode{        int m_nValue;        BiTreeNode m_pLeft;        BiTreeNode m_pRight;            }    //順序尋找，查到則返回該值下標，查不到返回-1.    public int SequenceSearch(int[] a,int b){        if(a==null)            return -1;        for(int i=0;i<a.length;i++){            if(a[i]==b)                return i;        }        return -1;    }    //折半尋找，二分尋找,要求尋找的數組是有序的。只適合於靜態尋找。    public int BinarySearch(int[] a,int b){        if(a==null)            return -1;        int low=0;        int high=a.length-1;        while(low<=high){            int middle=(low+high)/2;            if(a[middle]==b)                return middle;            if(a[middle]<b)                low=middle+1;            else                high=middle-1;        }        return -1;    }    //折半尋找的遞迴演算法    public int BinarySearch1(int[] a,int b,int low,int high){        if(a==null||low>high)            return -1;        int middle=(low+high)/2;        if(a[middle]==b)            return middle;        if(a[middle]<b)            return BinarySearch1(a,b,middle+1,high);        else            return BinarySearch1(a,b,low,middle-1);    }    //二叉排序樹，二叉尋找樹，二查搜尋樹，是一顆具有如下特點的樹，樹的左邊都比它小，樹的右邊都比它大。    public BiTreeNode BinaryBiSearch(BiTreeNode pHead,int b){        if(pHead==null)            return null;        if(pHead.m_nValue==b)            return pHead;        if(pHead.m_pLeft!=null)            return BinaryBiSearch(pHead.m_pLeft,b);        if(pHead.m_pRight!=null)            return BinaryBiSearch(pHead.m_pRight,b);        return null;    }    public static void main(String[] args){        int[] a={1,2,3,5,7,8,10};        Search search=new Search();                int i=search.BinarySearch(a,1);        int k=search.BinarySearch1(a, 3,0,a.length-1);        int j=search.SequenceSearch(a, 3);        System.out.println(i+" "+j+" "+k);    }}

 

Java實現三種常用的尋找演算法(順序查尋找，折半尋找，二叉排序樹尋找)