Binary Search | ASD

package lat03;
import java.util.Scanner;

/**
 * @author yufieko
 */

public class BinarySearch {
    public static int search(int key, int[] dt, int idL, int idR){
        int idT = idL + (idR - idL) / 2;

        if(idL > idR) return -1;
        else if(key == dt[idT]) return idT;
        else if(key < dt[idT]) return search(key, dt , idL, idT-1);
        else return search(key, dt, idT + 1, idR);
    }
    public static void main(String[] args) {
        int [] data = {2, 5, 8, 10, 14, 32, 35, 41, 67, 88, 90, 101, 109};
        Scanner input = new Scanner(System.in);

        System.out.print("Data yang dicari : ");
        int n = input.nextInt();
        int hasil = search(n, data, 0, data.length - 1);

        String pesan = hasil >= 0 ? "Data ditemukan pada index: " + hasil : "Data tidak ditemukan";
        System.out.println(pesan);
    }
}