How can I implement searching algorithms in Java?

How can I implement searching algorithms in Java?

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

Yes, please show me the linear search implementation.

Here's a simple linear search implementation in Java:

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; // target not found
}

What about binary search? How is it different?

Binary search is more efficient but requires a sorted array. Here's how you can implement it:

public static int binarySearch(int[] arr, int target) {
    int left = 0, right = arr.length - 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
}