Eclipse (II)

Die folgende Methode soll binäre Suche implementieren:

public static int binsearch (int [] x, int i) {
    int n = x.length;
    int low = 0;
    int high = n;
    while (low < high) {
        int mid = (low + high) / 2;
        if (i < x[mid]) {
            high = mid;
        } else if (i > x[mid]) {
            low = mid;
        } else {
            return mid;
        }
    }
    return -1;
}

Aufgaben:



Johannes Waldmann 2006-06-26