Question

All those points need to be in the code

Project 3 Iterative Linear Search, Recursive Binary Search, and Recursive Selection Sort Class River describes river's name and its length in miles. It provides accessor methods (getters) for both variables, toString() method that returns String representation of the river, and method isLong() that returns true if river is above 30 miles long and returns false otherwise. Class CTRivers describes collection of CT rivers. It has no data, and it provides the following service methods. None of the methods prints anything, except method printLongRiversRec, which prints all long rivers. Input parameter n in all methods is number of occupied elements in the list. Il Prints all long rivers in the list. Print them in same order they were in the list. List can be Il empy or not. • void printLongRiversRec (River[] list, int n) // Returns index for the river object with given name. Returns -1 for unsuccessful search. List can // be empy or not. int linearSearch (River [] list, int n, String name) // Returns ArrayList of rivers with length between min and max inclusive. If no such river was found, // method returns an empty Arraylist<River>. List can be empy or not. ArrayList <River> searchRange (River [] list, int n, int min, int max) I/ Sorts list of rivers by comparing them by names. Apply selection sort recursively. List of rivers can be Il empy or nonempty. Empty list and list with one river only are sorted. Lists with two or more rivers are Il sorted by swapping last river in the list with river object that has name that is last in lexicographic order // in the array, and after that recursively sorting sublist of first n-1 rivers. void sortByNameRec(River [] list, int n) I/PRECONDITION: Method assumes that input list is sorted by names. First and last are indices of the first // and last river of the current sublist. Method returns index of river object with given name or returns -1 // if none of the rivers has that name. List of rivers can be empy or not. • int binary SearchRec (River[] list, int first, int last, String name) The three methods highlighted in yellow must be implemented recursively. File "input.txt" Naugatuck 40 Pawsatuck 34 Quinebaug 69 Shepaug 26 Connecticut 407 Still 25 Quinnipiac 46 Housatoic 139 Class Driver has main method in it. Read data from the input file "input.txt" into an array of River objects, named riverList, and keep track of number of rivers stored in variable counter. Array riverList has capacity 100. Input file should be as shown. Program should work for any input file with up to 100 rivers in it. • Print all long rivers. • Apply one successful and one unsuccessful linear search. • Print all rivers with length between min and max (min and max are provided by user). Must use for each loop in the main method to print resulting ArrayList<River returned by method searchRange. Sort myList by river names, and print sorted list. • Apply one successful and one unsuccessful binary search on sorted list. Must print appropriate explanation in English of all steps performed in outcome. SUBMIT a single word or PDF document named p3_yourLastName_CS152 with the following in it: Your name, class section, project number and date of submission in the upper left corner. Copy of the code for each class and input file in separate rectangle. Picture of program run from Blue). Picture of UML diagram

Answer 1

Working code implemented in Java and appropriate comments provided for better understanding.

Here I am attaching code for these files:

• Driver.java
• River.java
• CTRivers.java

Driver.java:

import java.io.*;
import java.util.*;

/**
* Class Driver invokes the methods in class CTRivers.
*/
public class Driver
{
public static void main(String [] args) throws IOException
{
River[] riverList = new River[100];
String name;
int length;
int counter = 0;
Scanner fileScan = new Scanner (new File("input.txt"));
CTRivers obj = new CTRivers();
  
while(fileScan.hasNext())
{
name = fileScan.next();
length = fileScan.nextInt();
River oneRiver = new River(name, length);
riverList[counter] = oneRiver;
counter++;
}
  
// Method 1
System.out.println("List of Rivers:");
obj.printListRec(riverList, counter);
  
// Method 2
// successful
String river = "Connecticut";
System.out.println("\nSearching for: " + river);
System.out.println(obj.linearSearch(riverList, counter, river));
  
// unsuccessful
river = "Rhode Island";
System.out.println("\nSearching for: " + river);
System.out.println(obj.linearSearch(riverList, counter, river));
  
// Method 3
int min = 20;
int max = 50;
System.out.println("\nList of rivers between " + min + " and " + max + ":");
for(River r : obj.searchRange(riverList, counter, min, max))
{
System.out.println(r);
}
  
// Method 4
System.out.println("\nRivers sorted by name:");
obj.sortByNameRec(riverList, counter);
obj.printListRec(riverList, counter);
  
// Method 5
String riverName = "Pawcatuck";
String riverNameUnsuccessful = "Rhode Island River";
int first = 0;
int last = counter;
System.out.println("\nSearch for the river named " + riverName + ":");
System.out.print(obj.binarySearchRec(riverList, first, last, riverName));
  
System.out.println("\nSearch for the river named " + riverNameUnsuccessful + ":");
System.out.print(obj.binarySearchRec(riverList, first, last, riverNameUnsuccessful));
}
}

River.java:

/**
* Class River describes river's name and length as well as provides
* getter and setter methods.
*/
public class River
{
private String name;
private int length;
  
public River(String name, int length)
{
this.name = name;
this.length = length;
}
  
public String getName()
{
return name;
}
  
public int getLength()
{
return length;
}
  
public String toString()
{
return "Name: " + name + "\tLength: " + length;
}
}

CTRivers.java:

import java.io.*;
import java.util.*;
  
/**
* Class CTRivers describes a collection of CT rivers.
*/
public class CTRivers
{
// Prints all rivers recursively in the same order as they were in the list
// List may or may not be empty
void printListRec(River[] list, int n)
{
if (n > 0)
{
printListRec(list, n - 1);
System.out.println(list[n-1]);
}
}
  
// Returns index for the river object with given name. Returns -1 for unsuccessful search. List can
// be empy or not.
int linearSearch(River[] list, int n, String name)
{
int index = 0;
boolean found = false;
  
while (!found && index < n)
{
if(list[index].getName().equals(name))
found = true;
else
index++;
}
  
if (found)
return index;
else
return -1;
}
  
// Returns ArrayList of rivers with length between min and max inclusive. Returns an empty
// Arraylist<River> if no such river was found. List can be empy or not.
ArrayList <River> searchRange(River[] list, int n, int min, int max)
{
ArrayList<River> riverList = new ArrayList<River>();
if(n > 0)
{
for(int i = 0; i < n; i++)
{
if (list[i].getLength() >= min && list[i].getLength() <= max)
riverList.add(list[i]);
}
}
return riverList;
}
  
// Sorts list of rivers by selection sort recursively (Compare river by their names.) List can be empy or not.
public void sortByNameRec(River[] list, int n)
{
if(n > 1)
{
River temp;
for (int i = 0; i < n-1; i++)
{
if (list[i].getName().compareTo(list[i+1].getName()) > 0)
{
temp = list[i];
list[i] = list[i+1];
list[i+1] = temp;
}
}
sortByNameRec(list, n-1);
}
}

// PRECONDITION: Method assumes that input list is sorted by names. First and last are indices of the first
// and last character of the current substring. Returns index of River object with given name or returns -1
// if none of the rivers has that name. List can be empy or not.
int binarySearchRec(River[] list, int first, int last, String name)
{
int mid;
if(first > last)
return -1;
else
{
mid = (first+last)/2;
if(list[mid].getName().equals(name))
return mid;
else if(list[mid].getName().compareTo(name) > 0)
return binarySearchRec(list, first, mid-1, name); // name on left. call again and search left side.
else
return binarySearchRec(list, mid+1, last, name); // name on right. call again and search right side.
}
}
}

Sample Output Screenshots:

C:\Windows\System32\cmd.exe Microsoft Windows [Version 10.0.18363.1082] (c) 2019 Microsoft Corporation. All rights reserved. A: (CheggP\141>javac Driver.java A:\CheggP\141>java Driver List of Rivers: Name: Naugatuck Length: 40 Name: Pawcatuck Length: 34 Name: Quinebaug Length: 69 Name: Shepaug Length: 26 Name: Connecticut Length: 407 Name: Still Length: 25 Name: Quinnipiac Length: 46 Name: Housatoic Length: 139 Searching for: Connecticut 4 Searching for: Rhode Island -1 List of rivers between 20 and 50: Name: Naugatuck Length: 40 Name: Pawcatuck Length: 34 Name: Shepaug Length: 26 Name: Still Length: 25 Name: Quinnipiac Length: 46 Rivers sorted by name: Name: Connecticut Length: 407 Name: Housatoic Length: 139 Name: Naugatuck Length: 40 Name: Pawcatuck Length: 34 Name: Quinebaug Length: 69 Name: Quinnipiac Length: 46 Name: Shepaug Length: 26 Name: Still Length: 25 Search for the river named Pawcatuck: Search for the river named Rhode Island River: -1 A:\CheggP\141>