linear search – লিনিয়ার সার্চ

#include <stdio.h>
 
int search(int arr[], int n, int x)
{
    int i;
    for (i = 0; i < n; i++)
        if (arr[i] == x)
            return i;
    return -1;
}
 
// Driver code
int main(void)
{
    int arr[] = { 2, 3, 4, 10, 40 };
    int x = 10;
    int n = sizeof(arr) / sizeof(arr[0]);
   
    // Function call
    int result = search(arr, n, x);
    (result == -1)
        ? printf("Element is not present in array")
        : printf("Element is present at index %d", result);
    return 0;
}

// C++ program for linear search
#include<bits/stdc++.h>
using namespace std;

void search(vector<int> arr, int search_Element)
{
	int left = 0;
	int length = arr.size();
	int position = -1;
	int right = length - 1;
	
	// Run loop from 0 to right
	for(left = 0; left <= right;)
	{
		
		// If search_element is found with
		// left variable
		if (arr[left] == search_Element)
		{
			
			position = left;
			cout << "Element found in Array at "
				<< position + 1 << " Position with "
				<< left + 1 << " Attempt";
				
			break;
		}
	
		// If search_element is found with
		// right variable
		if (arr[right] == search_Element)
		{
			position = right;
			cout << "Element found in Array at "
				<< position + 1 << " Position with "
				<< length - right << " Attempt";
				
			break;
		}
		left++;
		right--;
	}

	// If element not found
	if (position == -1)
		cout << "Not found in Array with "
			<< left << " Attempt";
}

// Driver code
int main()
{
	vector<int> arr{ 1, 2, 3, 4, 5 };
	int search_element = 5;
	
	// Function call
	search(arr, search_element);
}
	
// This code is contributed by mayanktyagi1709