🔍 Linear Search – Simple Explanation with Visualization

Linear Search is the most basic searching technique where we check each element one by one until we find the target.

🧠 Problem Understanding (In Simple Words)

Imagine you are looking for a book in a pile:

👉 You don’t know any order
👉 So you check each book one by one

This is exactly how Linear Search works

💡 Why Use Linear Search?

• Works on unsorted data
• No preparation or sorting needed
• Very easy to implement

👉 Best suited for small datasets

🚀 Step-by-Step Approach

1. Start from the first element of the array
2. Compare each element with the target
3. If a match is found → return the index
4. If you reach the end without finding it → return -1

🎯 Visualization Using DrawToCode

Linear Search becomes very intuitive when visualized:

• Each element is checked one by one
• You can see how the algorithm moves sequentially
• Helps understand why it is slower for large data

👉 Using DrawToCode, you can:

• Track each comparison step
• See how many steps are required
• Compare it visually with Binary Search

💻 Code (JavaScript Example)

function linearSearch(arr, target) {
    for (let i = 0; i < arr.length; i++) {
        if (arr[i] === target) {
            return i;
        }
    }
    return -1;
}

⏱️ Complexity Analysis

🔍 Example Walkthrough

Input:

arr = [4, 2, 7, 1, 9]
target = 7

Execution:

• Check 4 → not match
• Check 2 → not match
• Check 7 → ✅ Found

👉 Output:

Index = 2

🧪 Edge Cases to Consider

• Empty array
• Single element array
• Target not present
• Multiple occurrences

⚖️ Linear Search vs Binary Search

🏁 Final Thought

Linear Search is a great starting point to understand searching:

• Simple and beginner-friendly
• Works in all cases
• Helps build foundation before advanced algorithms

👉 Once you visualize it, you clearly see why better algorithms like Binary Search are needed for large datasets