L I N E A R S E A R C H

package org.interview.test;

import java.util.Scanner;

/**
 * Above code locate first instance of element to found, you can modify it for multiple 
 * occurrence of same element and count how many times it occur in the list. 
 * Similarly you can find if an alphabet is present in a string.
 *
 */
public class LinearSearch {

public static void main (String [] args) throws Exception {
int c, 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 (c = 0; c < n; c++)
     array[c] = in.nextInt();
 
   System.out.println("Enter value to find");
   search = in.nextInt();
 
   for (c = 0; c < n; c++)
   {
     if (array[c] == search)     /* Searching element is present */
     {
        System.out.println(search + " is present at location " + (c + 1) + ".");
         break;
     }
  }
  if (c == n)  /* Searching element is absent */
     System.out.println(search + " is not present in array.");
}
}