在Java中的已排序文件中进行二进制搜索

RandomAccessFile file = new RandomAccessFile("sorted_file.txt", "r");

public static long binarySearch(RandomAccessFile file, String key) throws IOException {
    long low = 0;
    long high = file.length() - 1;

    while (low <= high) {
        long mid = (low + high) / 2;
        file.seek(mid);
        file.readLine();

        int cmp = key.compareTo(file.readLine());

        if (cmp > 0) {
            low = mid + 1;
        } else if (cmp < 0) {
            high = mid - 1;
        } else {
            return mid;
        }
    }

    return -1;
}

long result = binarySearch(file, "key_to_search");
if (result != -1) {
    System.out.println("Key found at position: " + result);
} else {
    System.out.println("Key not found");
}