linear search java_LinearSearch Java

Java LinearSearch

/**

*

*

*

Copyright 1994-2018 JasonInternational

*

All rights reserved.

*

Created on 2018年4月10日 上午9:46:32

*

Created by Jason

*

*

*/

package cn.ucaner.algorithm.search;

/**

* In computer science, linear search or sequential search is a method for finding a target value within a list. It sequentially checks each element of the list for the target value until a match is

* found or until all the elements have been searched.

*

* Worst-case performance O(n)

* Best-case performance O(1)

* Average performance O(n)

* Worst-case space complexity O(1)

*

* @see Linear Search (Wikipedia)

*

* @author Justin Wetherell

*/

public class LinearSearch {

public static final int find(int value, int[] array) {

for (int i = 0; i < array.length; i++) {

int iValue = array[i];

if (value == iValue)

return i;

}

return Integer.MAX_VALUE;

}

//Just for test

public static void main(String[] args) {

int[] nums = {1,2,3,4,5,6,7,8,9,0};

int finds = 8;

System.out.printf("数字:%d 在数组中的位置为:%d %n", finds,find(2, nums)+1);

}

}

//Outputs

//数字:8 在数组中的位置为:2