01 Linear Search

A search algorithm will find a value in a data structure.

Linear Search Intro

package linearSearchEx1;

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

public class Main {

	public static void main(String[] args) {
		int[] intArray = {54, 46, 83, 66, 95, 92, 43};
		
		int zero = linearSearch(intArray, 42); //not in list
		printValue(zero);
		int one = linearSearch(intArray, 54);
		printValue(one);
		int two = linearSearch(intArray, 95);
		printValue(two);
		int three = linearSearch(intArray, -15); //not in list
		printValue(three);

	}

	private static void printValue(int value) {
		
			System.out.println("Index: "+value);
	}

	private static int linearSearch(int[] input, int value) {
		for (int i =0; i < input.length; i++ ) {
			if (input[i] == value) {
				return i;
			}
		}
		return -1;
	}
}

Output: