What is linear search in Java?

What is linear search in Java?

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

Can you show me a code example of linear search in Java?

Sure! Here's a basic example:

public class LinearSearch {
    public static int linearSearch(int[] arr, int target) {
        for (int i = 0; i < arr.length; i++) {
            if (arr[i] == target) {
                return i; // return the index
            }
        }
        return -1; // return -1 if not found
    }
}

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.

When should I use linear search instead of binary search?

You should use linear search when the list is unsorted or when the list is small, as it is simpler to implement.