Binary Search Algorithm in C

Binary Search Algorithm in C

Binary Search DSA ka ek bahut hi important searching algorithm hai jo specially sorted arrays par kaam karta hai. Agar aap DSA roadmap for beginners follow kar rahe hain, to binary search samajhna zaroori hai kyunki ye efficient searching ka best example hai.

Linear search me hume har element check karna padta hai, lekin binary search me hum har step me data ko half kar dete hain, jis wajah se ye bahut fast hota hai. Isi wajah se binary search interviews me frequently poocha jata hai.

📌 What is Binary Search?

Binary Search ek algorithm hai jo sorted list me kisi element ko efficiently search karta hai.

Iska basic idea:
👉 Har step me array ko do parts me divide karo

📌 What You’ll Learn

• Binary Search kya hota hai

• Kaise kaam karta hai (step-by-step)

• Iterative & Recursive approach

• Real-life example

• C++ implementation

• Practice questions

⚙️ Conditions for Binary Search

Binary search apply karne ke liye:

• Array sorted hona chahiye

• Indexing available honi chahiye

👉 Agar array sorted nahi hai to pehle sorting karni padegi

🔄 How Binary Search Works (Step-by-Step)

Maan lo array hai:
[1, 2, 3, 4, 5, 6, 7]
Search karna hai: 5

Step 1

Middle element = 4
👉 5 > 4 → right side jao

Step 2

New array = [5, 6, 7]
Middle = 6
👉 5 < 6 → left side jao

Step 3

Element = 5 → found

👉 Isi tarah binary search kaam karta hai

💻 Binary Search Program in C

#include <stdio.h>

int binarySearch(int arr[], int n, int key){

   int low = 0, high = n - 1;

   while(low <= high){

       int mid = (low + high) / 2;

       if(arr[mid] == key)

           return mid;

       else if(arr[mid] < key)

           low = mid + 1;

       else

           high = mid - 1;

   }

   return -1;

}

int main(){

   int arr[] = {1,2,3,4,5,6,7};

   int result = binarySearch(arr, 7, 5);

   printf("%d", result);

   return 0;

}

Binary Search (Iterative) – C++

#include <iostream>

using namespace std;

int binarySearch(int arr[], int n, int target) {

    int low = 0, high = n - 1;

    while (low <= high) {

        int mid = low + (high - low) / 2;

        if (arr[mid] == target)

            return mid;

        else if (arr[mid] < target)

            low = mid + 1;

        else

            high = mid - 1;

    }

    return -1;

}

int main() {

    int arr[] = {10, 20, 30, 40, 50};

    int n = 5;

    int result = binarySearch(arr, n, 30);

    if (result != -1)

        cout << "Element found at index: " << result;

    else

        cout << "Element not found";

    return 0;

}

Binary Search (Recursive) – C++

int binarySearchRecursive(int arr[], int low, int high, int target) {

    if (low > high)

        return -1;

    int mid = low + (high - low) / 2;

    if (arr[mid] == target)

        return mid;

    else if (arr[mid] > target)

        return binarySearchRecursive(arr, low, mid - 1, target);

    else

        return binarySearchRecursive(arr, mid + 1, high, target);

}👉 Output: Index of element

📈 Time Complexity

Case                                      Complexity

Best Case                              O(1)

Average Case                        O(log n)

Worst Case                            O(log n)

👉 Binary search ka sabse bada advantage yehi hai ki ye fast hota hai

🎯 Applications of Binary Search

• Searching in large datasets

• Database indexing

• Competitive programming

• Interview questions

⚡ Advantages

• Fast searching

• Efficient for large data

• Easy to implement

❌ Disadvantages

• Sorted data required

• Linked list me efficient nahi

• Random access required

💡 Common Mistakes

• Unsorted array me binary search lagana

• Mid calculation galat karna

• Infinite loop create karna

👉 Tip: Always dry run karo

🚀 How to Master Binary Search

1. Concept clear karo

2. Iterative aur recursive dono samjho

3. Practice karo (10–20 questions)

4. Edge cases samjho

Agar aap binary search seekh rahe hain to ye topics bhi zaroor padhein:

• 👉 DSA Roadmap for Beginners in Hindi

• 👉 Stack in Data Structure

• 👉 Recursion in C

👉 Ye sab topics milkar aapki DSA strong banate hain

🏁 Conclusion

Binary search ek efficient aur powerful algorithm hai jo aapko fast searching sikhata hai. Agar aap DSA roadmap follow kar rahe hain to ye topic aapke liye must-learn hai.

Regular practice aur concept clarity ke saath aap binary search me strong ban sakte hain aur coding interviews ke liye prepare ho sakte hain.

👉 Complete Roadmap:

https://sites.google.com/view/dsarop/

👉 Next Topic: Recursion In C

https://sites.google.com/view/dsarop/recursion-in-c