Create an Eclipse Java project that utilize attached "Selection Sort" and "Binary Search" algorithms to search for an Employee object in an Employee[] of size 5, for which, need to write an Employee class, which should have first name (type String), last name (type String), and Employee ID number (type int), as well as getters, setters, constructor and necessary compareTo() method that facilitate sorting based on last name or Employee ID number. You need to modify or adapt the attached "Selection Sort" and "Binary Search" methods so that they can work with class objects in this exam project. 

In the main() method, populate Employee array with sample Employee objects, perform Selection Sort() to sort the array, then test the binary Search method. The project should prompt the user for an Employee ID to search for, print unsorted array and sorted array as well as Binary Search results by displaying the first name, last name and Employee ID if the Employee object was found, otherwise, inform the user that the Employee object was not found.

Transcribed Image Text:

public void selectionSort (Comparable<T> [] list) int min; Comparable<T> temp; for (int index = 0; index < list.length-1; index++) min = index; for (int scan index+1; scan < list.length; scan++) if (list[scan].compareTo ( (T) list [min]) < 0) min = scan; // Swap the values temp = list [min]; list[min] = list[index]; list[index] = temp; public Comparable<T> binarySearch (Comparable<T>[] list, Comparable<T> target) int min = 0, max = list.length - 1, mid = 0; boolean found = false; while (!found &6 min <= max) mid = (min+max) / 2; if (list (mid].equals (target)) found = true; else if (target.compareTo ( (T) list(mid]) < 0) max = mid-1; else min = mid+1; if (found) return list[mid] ; else return null; public void selectionSort (Comparable<T> [] list) int min; Comparable<T> temp; for (int index = 0; index < list.length-1; index++) min = index; for (int scan index+1; scan < list.length; scan++) if (list[scan].compareTo ( (T) list [min]) < 0) min = scan; // Swap the values temp = list [min]; list[min] = list[index]; list[index] = temp; public Comparable<T> binarySearch (Comparable<T>[] list, Comparable<T> target) int min = 0, max = list.length - 1, mid = 0; boolean found = false; while (!found &6 min <= max) mid = (min+max) / 2; if (list (mid].equals (target)) found = true; else if (target.compareTo ( (T) list(mid]) < 0) max = mid-1; else min = mid+1; if (found) return list[mid] ; else return null;

Answer rating: 100% (QA)

I am s... View the full answer