/**
* 顺序搜索
* Created by yuzhan on 2017/10/18.
*/publicclassmain {publicstaticintLinearSearch(int[] A, int x){
int j = 0;
int n = A.length;
while(j < n && x != A[j]){
j++;
}
if(j < n)
return j;
elsereturn -1;
}
publicstaticvoidmain(String[] args) {
int[] A = {2,1,3,6,4,23,65,75,34,67,32};
int x = 32;
int index = main.LinearSearch(A,x);
System.out.print(index);
}
}