Binary Search with Time Complexity in DSA using C++

Program 1

// Program for Binary Search in Data Structure
#include<iostream>
#define clrscr() system("cls")
using namespace std;
class Search
{
      public:
      int binarySearch(int ar[],int n,int s);
};
int Search::binarySearch(int ar[],int n,int s)
      {
           int low,high,mid;
           low=0;
           high=n-1;
           while(low<=high)
           {
               mid=(low+high)/2;
               if(s==ar[mid])
                    return 1;
               else
               if(s>ar[mid])
                  low=mid+1;
               else
               high=mid-1;   
           }
           return 0;
      }
      
int main()
{
    int a[500],n,s,i,temp,j;
    clrscr();
    xyz:cout<<"\nEnter limit of array";
    cin>>n;
    if(n>500 || n<0)   
    {
        cout<<"\nInvalid limit";
        goto xyz;
    }
    else
    {
        cout<<"\n Enter element in array";
        for(i=0;i<n;i++)
            cin>>a[i];
        //Sorting 
      for(i=0;i<n;i++)
      {
            for(j=i+1;j<n;j++)
            {
                if(a[j]<a[i])
                {
                    temp=a[i];
                    a[i]=a[j];
                    a[j]=temp;
                }
          }
      }
      cout<<"\n Enter element for search";
      cin>>s;
      Search S1;
      if(S1.binarySearch(a,n,s)) 
          cout<<"\nSearching success";
      else
         cout<<"\nSearching not success";  
  }
   return 0; 
}