Linear Search of an Array

  In  linear  search  we traverse  through elements  using or loop . Comparing  with elements 

 of desire  findings . 

public class LinearSearch {

    public static int linerSearch(int[] arr, int key){

        

        int size = arr.length;

        for(int i=0;i

        {

            if(arr[i] == key)

            {

                return i;

              }

           }

        return -1;

       }

    

     public static void main(String a[]){

        

        int[] arr1= {25,45,34,55,234,10,32,90};

        int searchKey = 55;

        System.out.println("Key "+searchKey+" found at index: "+linerSearch(arr1, searchKey));

        int[] arr2= {134,446,421,595,2134,41,367,190};

        searchKey = 190;

        System.out.println("Key "+searchKey+" found at index: "+linerSearch(arr2, searchKey));

    }

}

Program Output :.

Key 55 found at index: 3

Key 190 found at index: 7

 Another example of liner search where   you enter   through command line  

import java.util.Scanner

class LinearSearch

{

  public static void main(String args[])

    {

   int   i, n, search, array[];

    Scanner in = new Scanner(System.in);

    System.out.println("Enter number of elements");

    n = in.nextInt();

    array = new int[n] ;

    System.out.println("Enter " + n + " integers");

    for (i = 0; i < n; i++)

      array[i] = in.nextInt();

    System.out.println("Enter value to find");

    search = in.nextInt();

    for (i= 0; i < n; i++)

    {

      if (array[i] == search)  

  /* Searching element is present */

      {

        System.out.println(search + " is present at location " + ( i+ 1) + ".");

          break;

      }

   }

   if (i == n) 

    /* Element to search isn't present *

 System.out.println(search + " isn't present in array.");

  }

}

Program  out put 

 Enter number of elements : 9

Enter  9 integers