C Searching Algorithms 🎯

Welcome to our deep dive into the world of C Searching Algorithms! This lesson is designed for both beginners and intermediate learners who are eager to understand and implement search algorithms in C. Let's get started!

Understanding Search Algorithms 📝

Search algorithms are essential tools in computer science, helping us find specific data within a larger collection. They are crucial in various real-world applications such as databases, sorting data, and even in optimizing code.

Linear Search 💡

What is Linear Search?

Linear Search is a simple search algorithm that sequentially examines each element in an array or list until the desired value is found. Even though it's straightforward, it might not be the most efficient method for large datasets.

Implementing Linear Search in C

Here's a simple example of Linear Search implementation in C.

#include <stdio.h>

int linear_search(int arr[], int size, int target) {
    for (int i = 0; i < size; ++i) {
        if (arr[i] == target) {
            return i;
        }
    }
    return -1; // Not found
}

int main() {
    int arr[] = {1, 3, 5, 7, 9};
    int size = sizeof(arr) / sizeof(arr[0]);
    int target = 5;
    int result = linear_search(arr, size, target);

    if (result != -1) {
        printf("Element found at index: %d\n", result);
    } else {
        printf("Element not found in the array.\n");
    }

    return 0;
}

💡 Pro Tip: Linear Search is best used for small datasets or when the array is already sorted.

Binary Search 💡

What is Binary Search?

Binary Search is a more efficient search algorithm that works by repeatedly dividing the search interval in half. It's effective when the data is sorted.

Implementing Binary Search in C

Here's a simple example of Binary Search implementation in C.

#include <stdio.h>

int binary_search(int arr[], int size, int target, int low, int high) {
    if (low > high) {
        return -1; // Not found
    }

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

    if (arr[mid] == target) {
        return mid;
    } else if (arr[mid] < target) {
        return binary_search(arr, size, target, mid + 1, high);
    } else {
        return binary_search(arr, size, target, low, mid - 1);
    }
}

int main() {
    int arr[] = {1, 3, 5, 7, 9};
    int size = sizeof(arr) / sizeof(arr[0]);
    int target = 5;
    int result = binary_search(arr, size, target, 0, size - 1);

    if (result != -1) {
        printf("Element found at index: %d\n", result);
    } else {
        printf("Element not found in the array.\n");
    }

    return 0;
}

💡 Pro Tip: Binary Search requires the data to be sorted beforehand, making it faster for large datasets.

Happy Coding! 👩‍💻🚀