Search element in sorted or unsorted array (linear search)

 // first we store searching value in search variable and check value to each array element.

//Liner search using c++

#include<iostream>

using namespace std;

int searchinarray(int arr[],int s,int n)

{

    for (int i;i<n;i++) {

        if(s==arr[i])

        return 1;

    }

    return 0;

    

}

int main()

{

    int arr[]={1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25};

    int search;

    cout<<"Enter element to search in array : ";

    cin>>search;

    int n=sizeof(arr)/sizeof(arr[0]);

    //cout<<n;

    int b=searchinarray(arr,search,n);

    if(b)

    cout<<"Found."<<endl;

    else

    cout<<"Not Found."<<endl;

    

}

Time complixity - O(n)

Code on compiler