Linear Search // Sequential Search

Linear search ek simple search algorithm hai jo ek array ya list mein kisi specific element ko dhundne ke liye istemal hota hai. Yeh algorithm ek element ko ek ek karke dekhta hai, aur jab woh element mil jaata hai, toh uski position ya index ko return karta hai. Linear search ki khasiyat yeh hai ki yeh kisi bhi array ya list mein kaam karta hai, lekin iska time complexity O(n) hota hai, jahan n array ya list ki length hoti hai, iska matlab yeh hai ki agar aapke paas bada sa array hai toh ismein element dhundne mein jyada time lag sakta hai.

Java mein linear search ka ek example niche diya gaya hai:

```java

public class LinearSearch {

    public static int linearSearch(int[] arr, int key) {

        for (int i = 0; i < arr.length; i++) {

            if (arr[i] == key) {

                return i; // Element mil gaya, iska index return karo

            }

        }

        return -1; // Element nahi mila

    }

    public static void main(String[] args) {

        int[] arr = { 2, 4, 6, 8, 10, 12, 14 };

        int key = 8;

        int result = linearSearch(arr, key);

        if (result != -1) {

            System.out.println("Element " + key + " found at index " + result);

        } else {

            System.out.println("Element " + key + " not found in the array.");

        }

    }

}

```

Is code mein `linearSearch` function ek array mein diye gaye `key` element ko dhundne ke liye istemal hota hai. Agar element mil jaata hai toh uska index return hota hai, aur agar element nahi milta toh -1 return hota hai. 

Example: 

package aRray;

import java.util.*;

public class LinearSearch {

public static void main(String[] args) {

// TODO Auto-generated method stub

Scanner scan = new Scanner(System.in);

int size = scan.nextInt();

int [] arr = new int [size];

int userFind = scan.nextInt();

for(int i = 0 ; i < size; i++) {

arr[i] = scan.nextInt();

}

for(int i = 0; i < size; i++) {

if(arr[i] == userFind) {

System.out.println(i);

break;

}

}

}

}