Linear search is a simple algorithm that sequentially checks each element of a data collection one by one until a match is found or the end is reached. It involves traversing the array using a for loop, comparing the target value to the current array element in each iteration, returning the index if a match occurs or -1 if no match, and explaining its implementation through pseudocode steps. The document provides an overview of linear search and how to implement it through an example and algorithm.

1. Linear Search in Data Structure
Prof. Neeraj Bhargava
Kapil Chauhan
Department of Computer Science
School of Engineering & Systems Sciences
MDS University, Ajmer

2. Introduction
 Linear search is a very simple search algorithm.
 In this type of search, a sequential search is made over
all items one by one.
 Every item is checked and if a match is found then that
particular item is returned, otherwise the search
continues till the end of the data collection.

3. Implementing Linear Search
 Following are the steps of implementation that we will
be following:
 Traverse the array using a for loop.
 In every iteration, compare the target value with the
current value of the array.

4. Cont..
 If the values match, return the current index of the
array.
 If the values do not match, move on to the next array
element.
 If no match is found, return -1.

5. Example

6. Algorithm
 Linear Search ( Array A, Value x)
 Step 1: Set i to 1
 Step 2: if i > n then go to step 7
 Step 3: if A[i] = x then go to step 6

7. Cont..
 Step 4: Set i to i + 1
 Step 5: Go to Step 2
 Step 6: Print Element x Found at index i and go to step
8
 Step 7: Print element not found
 Step 8: Exit

8. Assignment
 Explain linear search in DS with suitable example and
also discuss algorithm.