V Sai Harsha

Posted on

# Linear Search Explained With Diagrams

## Introduction:

When it comes to searching for a specific item in a collection of data, algorithms play a crucial role in efficiently finding what we need. One such algorithm, the Linear Search, is a fundamental and straightforward method. In this article, we'll explore the concept of Linear Search with the help of clear diagrams, making it easy to understand even for those new to programming.

### What is Linear Search?

Linear Search, also known as Sequential Search, is the simplest searching algorithm. It works by examining each element in a dataset, one by one, until a match is found or until every element has been checked.

### How Linear Search Works:

Imagine you have an array of numbers:

[70,40,30,11,57,41,25,14,52]

And you want to find the number 41 within this array using Linear Search.

1. Start from the Beginning:
Begin at the first element of the array, which is 70 in this case.

2. Compare with the Target:
Compare the element you're currently examining (70) with the target value (41).

3. No Match? Move On:
Since 70 is not equal to 41, you move on to the next element in the array (40).

4. Keep Searching:
Continue this process until you either find the target (15) or reach the end of the array.

5. Found It!
In this case, you find the target value (41) after examining the fifth element.

### Pseudocode for Linear Search:

Here's a simple pseudocode representation of Linear Search:

``````function linearSearch(array, target):
for each element in array:
if element equals target:
return element found at index
``````

• Simple to understand and implement.
• Works with unsorted data.