What is linear search in C++?

Can you explain what linear search is in C++?

Sure! Linear search is a simple algorithm that checks each element in a list sequentially until the desired element is found or the list ends.

How does it work step by step?

1. Start from the first element of the array. 2. Compare the current element with the target value. 3. If they match, return the index. 4. If not, move to the next element. 5. Repeat until the element is found or the end of the array is reached.

What is the time complexity of linear search?

The time complexity of linear search is O(n), where n is the number of elements in the array. In the worst case, it checks every element.

Can you provide a simple code example?

Certainly! Here's a simple C++ code for linear search:

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