Introduction

Linear Search is the simplest searching technique in Data Structures and Algorithms (DSA) and is commonly used for small datasets or unsorted data. If you are enrolled in a DSA course in Jaipur, understanding linear search is important before moving to advanced searching algorithms.

It is also one of the first algorithms taught to beginners and is frequently asked in interviews for basic understanding.

What is Linear Search?

Linear Search is a method of finding an element in a list by checking each element one by one until the desired element is found or the list ends.

Example:
Array: [10, 20, 30, 40, 50]
Search for 30

Steps:

• Check 10 → not match
• Check 20 → not match
• Check 30 → match found

How Linear Search Works

1. Start from the first element
2. Compare each element with target
3. If match found → return index
4. If not found → return -1

Time Complexity of Linear Search

O(n)

• Best Case → O(1) (element found at first position)
• Worst Case → O(n) (element at last or not present)

Space Complexity

• O(1) (no extra space required)

Advantages of Linear Search

• Simple and easy to implement
• Works on unsorted data
• No preprocessing required

Disadvantages of Linear Search

• Slow for large datasets
• Inefficient compared to binary search
• Requires checking each element

When to Use Linear Search

• Small datasets
• Unsorted arrays
• Simple applications
• When simplicity is preferred

Real-World Applications

• Searching in small lists
• Finding items in unsorted data
• Basic lookup operations
• Educational purposes

Common Interview Questions

• Implement linear search
• Find element index
• Count occurrences
• Search in unsorted array

Best Practices

• Use for small inputs
• Switch to binary search for large sorted data
• Optimize using early exit

Summary

• Linear search checks elements sequentially
• Works on unsorted data
• Time complexity is O(n)
• Simple but not efficient for large datasets

FAQs

Q1. What is linear search in DSA?
It is a method of searching elements sequentially.

Q2. What is the time complexity of linear search?
O(n).

Q3. Does linear search require sorted data?
No, it works on unsorted data.

Q4. When should we use linear search?
For small datasets or unsorted arrays.

Q5. Is linear search important for interviews?
Yes, for basic understanding.

Internal Link

To explore more programming and development courses, click here for more free courses.