Program to demonstrate Linear Search Using Arrays

/**
 * Program to demonstrate Linear Search Using Arrays.
 **/
import java.io.*;
public class Arry_Search
{
     public static void main()throws IOException
    {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
       System.out.print(“Enter the number of elements you want to input ==> “);
       int size = Integer.parseInt(br.readLine());
        int arry[] = new int[size];
        int flag = 0, loc = 0;
        for(int i=0;i<arry.length;i++)
         {
             System.out.print(“Enter number “+(i+1)+” ==> “);
             arry[i] = Integer.parseInt(br.readLine());
         }
        System.out.print(“Enter number to be searched ==> “);
        int num = Integer.parseInt(br.readLine());
        for(int i = 0; i < arry.length ;i++ )
        {
            if (arry[i] == num)
            {
                flag = 1;
                loc = i;
                break;
            }
        }
        if (flag == 1)
        {
            System.out.println(“Number “+num+” found in “+(loc+1)+” location”);
        }
        else
        {
            System.out.println(“Number not found “);
        }
    }
}