Question: Can it be as simple as possible? Comments would be great rite a Java program o classes, as follows: Class: HWS Q2_YourStudentld Demo You will

 Can it be as simple as possible? Comments would be great

Can it be as simple as possible? Comments would be great

rite a Java program o classes, as follows: Class: HWS Q2_YourStudentld Demo You will do the following in the main method of this class: Open a given.txt file (you may hard code the filename) containing n names, and read and store these names into a String array - Ask user to enter a name to search in the array, - Create an object of SortAndSearch class (described below) and use the sort and search methods on this object. The search method returns true if the name exits in the list, else returns false, Print "The given name.. exists" if the name is found, else The given name. is not found", if the name doesn't exist in the list. Class: SortAndSearch, with the following properties: - one instance field, i.e. String array -constructor that sets the String array field with the input String array - method 1 (for sorting) accepts the String array of as its argument, sorts it (using Selection sort algorithm), and returns the sorted array; method 2 (for searching) accepts two arguments: the sorted array and a specific name to search in this array (using Binary search algorithm), and returns true if the given name exists, otherwise returns false. - Sample output is as below. If the txt file contains the following names (show the working of your program with at least 10 names in the .txt file): John Mary Ravi Madeeha Pradeep Brandon Stephane Mark Abdul Ram And the user enters the following name to search: Enter the name to search: Mark The sorted array will be as follows: Abdul Brandon John Madeeha Mark Mary Pradeep Ram Ravi Stephane After the search is performed, the program will print: The given name "Mark exists

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!