Question

Read a "dictionary" file and store the listed words in an array (not an arraylist)

Analyze a given text file "file.txt" and search for every word in "file.txt" in the "dictionary.txt" file using a binary search algorithm. (You may not use the binarySearch method in arrays class)

Print words not found in the dictionary as potentially incorrect; count the number of incorrectly spelled/not located words, count the number of correctly spelled words, and count the total number of words. Output those counters alongside the total time to run the program.

Answer 1

CODE

Main.java   

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.util.*;

class Main {

    public static void main(String[] args) throws java.lang.Exception {

        long startTime = System.nanoTime();
        //reading the file
        //provide the path where Dict.txt exist
        File dict = new File("C:\\Users\\YASH\\IdeaProjects\\Hiring\\src\\Dict.txt");
        BufferedReader br = new BufferedReader(new FileReader(dict));

        StringBuilder s = new StringBuilder();
        String sx;
        while ((sx = br.readLine()) != null) {
            s.append(sx).append(" ");
        }
        //stored in array
        String[] T = s.toString().split(" ");

        //provide the path where  File.txt exist
        File file = new File("C:\\Users\\YASH\\IdeaProjects\\Hiring\\src\\File.txt");
        BufferedReader bx = new BufferedReader(new FileReader(file));

        String sz;
        s = new StringBuilder();
        while ((sz = bx.readLine()) != null) {
            s.append(sz).append(" ");
        }

        //file words stored in array
        String[] F = s.toString().split(" ");

        //sorting the words in dictionary
        Arrays.sort(T);

        int incorrect = 0;
        int correct = 0;
        for (String value : F) {
            if (binarySearch(T, value) == -1) {
                incorrect++;
                System.out.println(" potentially incorrect ");
            } else {
                correct++;
                System.out.println(" " + value + " ");
            }
        }
        long endTime = System.nanoTime();
        System.out.println(" incorrect = " + incorrect);
        System.out.println(" correct = " + correct);

        double time = (endTime-startTime);

        //time in milli second
        System.out.println(" time = " + time/1000000 ) ;
    }

    //binary search to search the words
    private static int binarySearch(String[] A, String x) {
        int left = 0, right = A.length - 1;
        while (left <= right) {
            int mid = (right + left) / 2;
            int res = x.compareTo(A[mid]);
            if (res == 0)
                return mid;
            if (res > 0)
                left = mid + 1;
            else
                right = mid - 1;
        }
        return -1;
    }
}

Output

Words in Dict.txt

Apple
Axle
Box
Boy
Cat
Dog

Words in File.txt

Boy
Axle
Bush

Output

Boy
Axle
potentially incorrect
incorrect = 1
correct = 2
time = 1.1894