1.顺序查找算法
public static int sequenceSearch(Object[] a,Object x,int n){ a[n]=x; int i; for(i=0;;i++) if(a[i].equals(x)) break; if(i
2.二分查找算法
public static int binarySearch(Object[] a,Object x,int n){ int low=0;high=n-1; while(low<=high){ int mid=(low+high)/2; if(((Comparable)a[mid]).compareTo(x)==0) return mid; else if(((Comparable)a[mid]).compareTo(x)>0) high=mid-1; else low=mid+1; } return -1;}