二进制搜索双数组

public class Main{

/**
n o w j a v a . c o m - 时代Java
**/

    public static int binsearch(double[] xs, double x) {

        int lo = 0, hi = xs.length - 1;

        while (hi - lo > 1) {

            final int mid = midpoint(lo, hi);

            if (xs[mid] <= x) {

                lo = mid;

            } else {

                hi = mid;

            }

        }

        return lo;

    }

    public static