TernarySearch.java

package Java.Searching algorithms;

public class TernarySearch {
    public static int ternarySearch(int[] arr, int target, int left, int right) {
        if (right >= left) {
            int mid1 = left + (right - left) / 3;
            int mid2 = right - (right - left) / 3;

            if (arr[mid1] == target) return mid1;
            if (arr[mid2] == target) return mid2;

            if (target < arr[mid1]) return ternarySearch(arr, target, left, mid1 - 1);
            else if (target > arr[mid2]) return ternarySearch(arr, target, mid2 + 1, right);
            else return ternarySearch(arr, target, mid1 + 1, mid2 - 1);
        }
        return -1;
    }

    public static void main(String[] args) {
        int[] arr = {1, 3, 5, 7, 9};
        int index = ternarySearch(arr, 7, 0, arr.length - 1);
        System.out.println(index != -1 ? "Found at index " + index : "Not found");
    }
}