Linear Search using Array in DSA Java

Program 1

import java.util.*;
class MyClass
{
      static boolean  searchData(int ar[],int s)
      {
                for(int i=0;i<ar.length;i++)
                {
                      if(ar[i]==s)    
                      {
                         return true;
                      }
                }
           return false;     
      }
}
class LinearSearch
{
      public static void main(String args[])
      {
              int ar[],n,i,s,f=0;
              Scanner scan=new Scanner(System.in);
              System.out.println("Enter the limit of array");
              n=scan.nextInt();
              ar=new int[n];
              System.out.println("Enter elements in array");
                for(i=0;i<n;i++)
               { 
                 ar[i]=scan.nextInt();
               } 
                System.out.println("Enter an element for search");
                s=scan.nextInt();
                if(MyClass.searchData(ar,s))
                   System.out.println("Searching success");
                    else
                   System.out.println("Searching not success");  
               
               
               
               
               
               
               
               




                // for(i=0;i<n;i++)
                // {
                //       if(ar[i]==s)    
                //       {
                //               f=1;
                //               break;
                //       }
                // }
                // if(f==1)
                //     System.out.println("Searching success");
                //     else
                //     System.out.println("Searching not success");
      }
}