经典算法之顺序查找(Sequential Search)

public class SequentialSearch {
    public static void main(String[] args) {
        int[] nums = {12,15,54,85,25,64,54};
        Scanner sc = new Scanner(System.in);
        System.out.println("输入要查找的数据：");
        int target = sc.nextInt();
        int i = search(nums, target);
        if(i != -1){
            System.out.println("查找成功，该元素的下标为" + i);
        }else{
            System.out.println("查找失败！");
        }
    }
    /**
     * 顺序查找
     * @param array
     * @param key
     * @return
     */
    static int search(int[] array,int key){
        for (int i = 0;i < array.length;i++){
            if (array[i] == key){
                return i;
            }
        }
        return -1;
    }
}