How do I implement searching algorithms in C++?

How do I implement searching algorithms in C++?

You can implement searching algorithms like linear search and binary search in C++. Would you like to see examples?

Yes, please show me the linear search implementation.

Here's a simple linear search implementation:

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

Would you like to see binary search next?

Sure, how does binary search work?

Binary search works on sorted arrays. It repeatedly divides the search interval in half. Here's the implementation:

int binarySearch(int arr[], int size, int target) {
    int left = 0, right = size - 1;
    while (left <= right) {
        int mid = left + (right - left) / 2;
        if (arr[mid] == target) return mid;
        if (arr[mid] < target) left = mid + 1;
        else right = mid - 1;
    }
    return -1; // target not found
}