# (Solved Homework): Goal Build three search algorithms to find matching names in two different lists using Java.

Goal

Build three search algorithms to find matching names in two different lists using Java.

____

Problem

1. Read two input files, each containing a sorted list of first names. Assume the input

files will be in the working directory and will be named list1.txt and list2.txt.

2. Find the matching names using three different algorithms. The first list could be

considered the reference list, and the second list would contain the list of names to be

found.

(a) The first search method, named findByBruteForce should use a linear search of

the target list. The inputs to this function will be the two lists.

(b) The second search method, named findByBinarySearch should implement a binary

search algorithm. The inputs to this function will be the two lists.

(c) The third search method, named findByFinesse should implement the tokenized

search discussed in class and summarized below.

Start two markers, one for each list, at the beginning of each list.

Repeat the process outlined below

Compare the two marked items

If both are equal print the name and advance both markers one element.

else since they’re not equal advance the marker that comes first, alphabetically.

EDIT: Go through the list tokenizing word by word. Then compare letter by letter to see if the words are the same. IF they are different then move the marker (A < B < C) alphabetically on the list that it applies to. IF they are the same then move both markers by one and print the name. Thanks for the help.

____

Testing

There are three _les supplied with the assignment:

1. list1.txt which contains the list of five names.

2. list2.txt also contains a list of five names.

3. expectedOutput.txt which is a redirection of the output. This is to be used as the

baseline for running the diff command to confirm the output results and formatting.

(See the Sample Output below for an example of how diff will be used.)

____

Sample output

java Lab01

list1.txt contains:

Akira

Bart

Chase

Declan

Duffman

list2.txt contains:

Atkins

Blinky

Carl

Duffman

Lisa

The method findByBruteForce found the following match(es):

Duffman

The method findByBinarySearch found the following match(es):

Duffman

The method findByFinesse found the following match(es):

Duffman

java Lab01 >myOutput.txt

diff myOutput.txt expectedOutput.txt

Note The diff command will report any differences between the input files. No output means there is no differences between the input files.

## Expert Answer

Here is the code for the question. Output file contents is also shown. Please don’t forget to rate the answer if it helped. Thank you very much.

import java.io.File;

import java.io.FileNotFoundException;

import java.io.PrintWriter;

import java.util.ArrayList;

import java.util.Scanner;

public class SearchAlgorithms {

//loads the contents specified file into and an arraylist and returns the list

private static ArrayList<String> loadFile(String filename) throws FileNotFoundException

{

Scanner scanner = new Scanner(new File(filename));

ArrayList<String> list = new ArrayList<String>();

while(scanner.hasNext())

{

String str = scanner.next();

list.add(str);

}

scanner.close();

return list;

}

// words from list2 are searched in list1 using linear search algorithm. words that

//were found in are printed into writer object

private static void findByBruteForce(ArrayList<String> list1, ArrayList<String> list2,PrintWriter writer)

{

String search;

boolean found;

writer.write(“nThe method findByBruteForce found the following match(es):n”);

for(int i = 0; i < list2.size()-1; ++i) //loop through list2

{

search = list2.get(i);

found = false;

//search the word in list1 linearly

for(int j = 0; j < list1.size() && !found; ++j)

{

if(list1.get(j).equals(search))

found = true;

}

//if found , write into writer

if(found)

writer.write(search+”n”);

}

}

// words from list2 are searched in list1 using binary search algorithm. words that

//were found in are printed into writer object

private static void findByBinarySearch(ArrayList<String> list1, ArrayList<String> list2,PrintWriter writer)

{

String search;

boolean found;

int start, end, mid, cmp;

writer.write(“nThe method findByBinarySearch found the following match(es):n”);

for(int i = 0; i < list2.size(); ++i) //loop through words in list2

{

search = list2.get(i);

//reset all variables

found = false;

start = 0;

end = list1.size()-1;

while(!found && start <= end)

{

mid = (start + end)/2;

cmp = search.compareTo(list1.get(mid));

if(cmp == 0)

found=true;

else if(cmp < 0 )

end = mid – 1;

else

start = mid + 1;

}

if(found) //write to writer if found

writer.write(search+”n”);

}

}

// words from list2 are searched in list1 using Finesse method. words that

//were found in are printed into writer object

private static void findByFinesse(ArrayList<String> list1, ArrayList<String> list2,PrintWriter writer)

{

writer.write(“nThe method findByFinesse found the following match(es):n”);

int idx1 = 0, idx2 =0;

String word1, word2;

int cmp;

while(idx1 < list1.size() && idx2 < list2.size())

{

word1 = list1.get(idx1);

word2 = list2.get(idx2);

cmp = word1.compareTo(word2);

if(cmp == 0) //words matched

{

writer.write(word1);

idx1++;

idx2++;

}

else if(cmp < 0) //word1 is alphabetically before word2

idx1++;

else //word2 is alphabetically before word1

idx2++;

}

}

public static void main(String[] args) {

try {

//load the files into 2 lists

ArrayList<String> list1 = loadFile(“list1.txt”);

ArrayList<String> list2 = loadFile(“list2.txt”);

//writer for output file

PrintWriter writer = new PrintWriter(new File(“output.txt”));

findByBruteForce(list1, list2, writer);

findByBinarySearch(list1, list2, writer);

findByFinesse(list1, list2, writer);

writer.close();

} catch (FileNotFoundException e) {

System.out.println(e.getMessage());

}

}

}

input file list1.txt

Akira

Bart

Chase

Declan

Duffman

input file list2.txt

Atkins

Blinky

Carl

Duffman

Lisa

output file output.txt

The method findByBruteForce found the following match(es):

Duffman

The method findByBinarySearch found the following match(es):

Duffman

The method findByFinesse found the following match(es):

Duffman

Order NOW for a 10% Discount
Pages (550 words)
Approximate price: -

Why Us?

Top Quality and Well-Researched Papers

All ourbpapers are written from scratch. In fact, Clients who ask for paraphrasing services are highly discouraged. We have writers ready to craft any paper from scratch and deliver quality ahead of time.

Professional and Experienced Academic Writers

Our writers keeps you posted on your papers progress - providing you with paper outline/draft. You are also at liberty to communicate directly with your writer.

Free Unlimited Revisions

If you think we missed something, send your order for a free revision. You have 10 days to submit the order for review after you have received the final document. You can do this yourself after logging into your personal account or by contacting our support.

Prompt Delivery and 100% Money-Back-Guarantee

All papers are always delivered on time, in many cases quite ahead of time. In case we need more time to master your paper, we may contact you regarding the deadline extension. In case you cannot provide us with more time, a 100% refund is guaranteed.

Original & Confidential

We use several writing tools checks to ensure that all documents you receive are free from plagiarism. Our editors carefully review all quotations in the text. We also promise maximum confidentiality in all of our services.

24/7 Customer Support

Our support agents are available 24 hours a day 7 days a week and committed to providing you with the best customer experience. Get in touch whenever you need any assistance.

Try it now!

## Calculate the price of your order

Total price:
\$0.00

How it works?

Follow these simple steps to get your paper done

Place your order

Fill in the order form and provide all details of your assignment.

Proceed with the payment

Choose the payment system that suits you most.

Receive the final file

Once your paper is ready, we will email it to you.

Our Services

No need to work on your paper at night. Sleep tight, we will cover your back. We offer all kinds of writing services.

## Essay Writing Service

No matter what kind of academic paper you need and how urgent you need it, you are welcome to choose your academic level and the type of your paper at an affordable price. We take care of all your paper needs and give a 24/7 customer care support system.

Admission Essays & Business Writing Help

An admission essay is an essay or other written statement by a candidate, often a potential student enrolling in a college, university, or graduate school. You can be rest assurred that through our service we will write the best admission essay for you.

Editing Support

Our academic writers and editors make the necessary changes to your paper so that it is polished. We also format your document by correctly quoting the sources and creating reference lists in the formats APA, Harvard, MLA, Chicago / Turabian.

Revision Support

If you think your paper could be improved, you can request a review. In this case, your paper will be checked by the writer or assigned to an editor. You can use this option as many times as you see fit. This is free because we want you to be completely satisfied with the service offered.