Java:在排序列表中查找元素的最佳方法是什么？

public static int binarySearch(List<Integer> list, int target) {
    int left = 0;
    int right = list.size() - 1;

    while (left <= right) {
        int mid = left + (right - left) / 2;

        if (list.get(mid) == target) {
            return mid;
        } else if (list.get(mid)< target) {
            left = mid + 1;
        } else {
            right = mid - 1;
        }
    }

    return -1;
}