Linear Search Algorithm in DSA C++

Program 1

// Linear Search 
#include<iostream>
#include<stdio.h>
using namespace std;
class  Search
{
      int myarrray[1000],s,len;
      public:
      Search(int myar[],int mys,int l)
      {
             for(int i=0;i<l;i++)
             {
                myarrray[i]=myar[i];
             }
           s=mys;
           len=l;
      }
      int mysearch()
      {
            int i;
            for(i=0;i<len;i++)
            {
                 if(myarrray[i]==s)
                   return 1;
            }
            return 0;
      }

};

int main()
{
    system("cls");
     int ar[500],n,s;
     cout<<"Enter the limit: ";
     cin>>n;
     cout<<"\n Enter element in array: ";
     for(int i=0;i<n;i++)
        cin>>ar[i];
     cout<<"\n Enter element for search: " ;
     cin>>s;
      Search S1(ar,s,n);
        if(S1.mysearch())
          cout<<"Searching success" ;
        else
            cout<<"Searching not success" ; 
     
    return 0;
}

Program 2

// Linear Search 
#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
    system("cls");
     int ar[500],n,s,i,pos,flag=0;
     cout<<"Enter the limit: ";
     cin>>n;
     cout<<"\n Enter element in array: ";
     for(int i=0;i<n;i++)
        cin>>ar[i];
     cout<<"\n Enter element for search: " ;
     cin>>s;
     for(int i=0;i<n;i++)
     {
           if(ar[i]==s)
           {
                flag=1;
                pos=i;
                break;
           }
     }
     if(flag==1)
      cout<<"\n Searching success";
     else
      cout<<"\n Searching not success";
      if(pos==0)
         cout<<"\n Best Case";
      else if(pos>=0 && pos<n)   
         cout<<"\n Avg Case";
       else
          cout<<"\n Wrost Case";  

    return 0;
}