算法分析设计与分析-蛮力法（3）--顺序查找

package Force_Method;public class Sequentialsort {public static void main(String[] args) {// TODO Auto-generated method stubint a[] = {87,45,68,90,29,34,17,123,12456,1};int k=1;System.out.println(Sequentialsort(a,k));}private static int Sequentialsort(int[] a, int k) {//顺序查找for(int i=0;i<a.length;i++){if(a[i]==k){return i;}}return -1;}}