Linear Search Using Vector (DSA)

Linear search is one of the most fundamental and straightforward searching algorithms. It works by sequentially checking each element in a data structure from start to finish until it finds a match for the target value

Pre assigned values of Vector

#include <iostream>
#include <vector>
using namespace std;

int ret(vector<int> vec, int tar);
int main() {
    vector<int> arr = {23,4,3,42,23,22,42,848};
    int tar = 848;
    cout<<ret(arr,tar);
}

int ret(vector<int> vec , int tar){
    int index = 0;
    for(int ele : vec){
        if(ele == tar){
            return index;
        }
        index++;
    }
    return -1;
}

Element from User Input:

#include <iostream>
#include <vector>
using namespace std;

int ret(vector<int> vec, int tar);
int main() {
    int size;
    cout<<"Enter the Size of vector: ";
    cin>>size;
    vector<int> arr;
    for(int i  =0 ; i< size; i++){
        cout<<"Enter "<<i+1<<" element of Vector: ";
        int num;
        cin>>num;
        arr.push_back(num);
    }
    int tar;
    cout<<"Enter target Element: ";
    cin>>tar;


    int res = ret(arr,tar);
    if(res < 0){
        cout<<"Element Not found!!";
    }else{
        cout<<"Element found at index: "<<res;
    }
}

int ret(vector<int> vec , int tar){
    int index = 0;
    for(int ele : vec){
        if(ele == tar){
            return index;
        }
        index++;
    }
    return -1;
}