Linear Search=Chiziqli Qidiruv Problem

Linear Search=Chiziqli Qidiruv
Problem: Given an array arr[] of n elements, write a function to search a given element x in arr[].
Masala: n ta elementdan iborat arr[] massiv berilgan bo‘lsa, arr[] massivda berilgan x elementni qidirish dasturini tuzing.
Examples:
Input: arr[] = {10, 50, 30, 70, 80, 60, 20, 90, 40}
x = 20;
Output: 6
Element x is present at index 6.


Input: arr[] = {10, 50, 30, 70, 80, 60, 20, 90, 40}
x = 25;
Output: -1
Element x is not present in arr[].


Misollar:
Kirish: arr[] = {10, 50, 30, 70, 80, 60, 20, 90, 40}
x = 20;
Chiqish: 6
X elementi 6 indeksda mavjud.


Kirish: arr[] = {10, 50, 30, 70, 80, 60, 20, 90, 40}
x = 25;
Chiqish: -1
X elementi arr[] massivda mavjud emas.


Algorithm: A simple approach is to do a linear search, i.e

1. 
   Start from the leftmost element of arr[] and one by one compare x with each element of arr[]
   
2. 
   If x matches with an element, return the index.
   
3. 
   If x doesn’t match with any of elements, return -1.
   

Algoritm: Eng oddiy yondashuv chiziqli qidiruvni amalga oshirishdir, ya'ni.

1. 
   arr[] ning eng chap elementidan boshlang va x ni arr[] ning har bir elementi bilan birma-bir solishtiring.
   
2. 
   Agar arr[] massivning biror elementi x element bilan mos kelsa, indeksni qaytaring.
   
3. 
   Agar x element massiv elementlarining birortasiga mos kelmasa, -1 ni qaytaring.
   

Masalaning C++ tilidagi algoritmi:
#include
using namespace std;
int LinearSearch(int arr[], int n, int x)
{
int i;
for (i = 0; i < n; i++)
if (arr[i] == x)return i;
return -1;
}
int main(void)
{
int arr[] = {10, 50, 30, 70, 80, 60, 20, 90, 40};
int x = 20;
int n = sizeof(arr) / sizeof(arr[0]);
// Funksiyaga murojaat:
int result = LinearSearch(arr, n, x);
(result == -1)
? cout << "Massivda bunday element yo’q."
: cout << "Element indeksi:" << result;
return 0;
}
Natija:
Element indeksi: 6.
Masalaning C# tilidagi algoritmi:
using System;
class GFG {
public static int LinearSearch(int[] arr, int x)
{
int n = arr.Length;
for (int i = 0; i < n; i++)
{
if (arr[i] == x) return i;
}
return -1;
}
// Asosiy metod
public static void Main()
{
int[] arr = {10, 50, 30, 70, 80, 60, 20, 90, 40};
int x = 20;
// Metodga murojaat
int result = LinearSearch(arr, x);
if (result == -1)
Console.WriteLine("Massivda bunday element yo'q.");
else
Console.WriteLine("Element indeksi: " + result);
}
}
Natija:
Element indeksi: 6.