Linear Search
Sequential search through an array for a target key.
package DSA.Arrays;
import java.util.Scanner;
public class linerSearch { public static int linerSearchin(int arr[], int key) { for (int i = 0; i < arr.length; i++) { if (arr[i] == key) { return i; } } return -1; }
public static void main(String[] args) { try (Scanner sc = new Scanner(System.in)) { System.out.println("Enter The Length of the array: "); int length = sc.nextInt(); System.out.println("Enter the array values: "); int numbers[] = new int[length]; for (int i = 0; i < numbers.length; i++) { numbers[i] = sc.nextInt(); } System.out.println("Enter the element to Search: "); int key = sc.nextInt(); int result = linerSearchin(numbers, key); if (result == -1) { System.out.println("Invalid Key"); } else { System.out.println("Elment Found at:" + result); } } catch (Exception e) { System.out.println(e); } }}