🌟 The Honest Journey of a Student: Learning, Failing, and Growing

 

🚀 Searching Algorithms in DSA – Linear Search & Binary Search

---

💡 Did You Know?

Imagine finding a name in a list of 10,000 students…

👉 Checking one by one is slow ❌
👉 Using smart algorithms is faster ✅

That’s why Searching Algorithms are important in DSA 🚀

---

🔰 Introduction

Searching means finding a specific element in data.

👉 Example:

• Finding a contact in your phone 📱

• Searching a word in dictionary 📖

• Finding student record 💻

There are two important searching methods:

1. Linear Search

2. Binary Search

---

🔹 1. Linear Search

👉 Linear Search checks elements one by one from start to end.

---

🖼️ Visualization

---

💻 Linear Search Program

#include <stdio.h>   // Includes standard input/output functions like printf()

int main() {         // Main function where program execution starts

    int arr[5] = {10, 20, 30, 40, 50}; // Declare and initialize an array of 5 elements
    
    int key = 30;    // Store the element we want to search

    for(int i = 0; i < 5; i++) {   // Loop through all array elements

        if(arr[i] == key) {        // Check if current element matches key
            
            printf("Element found at index %d", i); // Print index of found element
            
            return 0;              // Exit program successfully
        }
    }

    printf("Element not found");   // Print if element is not found after loop ends

    return 0;                      // End program successfully
}

---

📤 Output

Element found at index 2

---

⚡ Time Complexity

👉 Best Case: O(1)
👉 Worst Case: O(n)

---

💡 Real-Life Example

👉 Searching a contact manually in an unsorted list.

---

🔹 2. Binary Search

👉 Binary Search is a faster searching technique.

⚠️ It works only on sorted arrays.

---

🖼️ Visualization

---

💻 Binary Search Program

#include <stdio.h>   // Includes standard input/output library

int main() {         // Main function starts execution

    int arr[7] = {10, 20, 30, 40, 50, 60, 70}; // Sorted array declaration

    int low = 0;     // Starting index of array
    int high = 6;    // Last index of array
    int mid;         // Variable to store middle index
    int key = 50;    // Element to search

    while(low <= high) {   // Continue searching while low <= high

        mid = (low + high) / 2;   // Calculate middle index

        if(arr[mid] == key) {     // Check if middle element equals key
            
            printf("Element found at index %d", mid); // Print index if found
            
            return 0;             // Exit program
        }

        else if(arr[mid] < key) { // Check if key is greater than mid element
            
            low = mid + 1;        // Move search to right half
        }

        else {                    // Otherwise key is smaller
            
            high = mid - 1;       // Move search to left half
        }
    }

    printf("Element not found");  // Execute if element not present

    return 0;                     // End program
}

---

📤 Output

Element found at index 4

---

⚡ Time Complexity

👉 Best Case: O(1)
👉 Worst Case: O(log n)

---

💎 Linear Search vs Binary Search

---

⚠️ Common Mistakes

❌ Using Binary Search on unsorted arrays
❌ Wrong middle index calculation
❌ Incorrect loop conditions

---

💡 Pro Tip

👉 Use:

• Linear Search for small data

• Binary Search for large sorted data

---

🧪 Practice Questions (with Answers)

1. What is searching?

👉 Answer:
Searching means finding an element in data.

---

2. Which search works on unsorted arrays?

👉 Answer:
Linear Search.

---

3. Which search is faster?

👉 Answer:
Binary Search.

---

4. What is required for Binary Search?

👉 Answer:
Array must be sorted.

---

💎 Final Words

Searching algorithms are one of the most important concepts in DSA.

👉 Once you master them:

• Problem-solving improves

• Logic becomes stronger

• Coding becomes faster

🚀 Keep practicing and keep growing!

---

📢 Support & Share

💬 If you found this helpful, share it with your friends!

🚀 Follow Learning Growth Hub for more powerful DSA tutorials.

📌 Keep Learning. Keep Coding. Keep Growing.

✨ Written by Krishna Popat
🌱 Founder – Learning Growth Hub

---