Provided are a PrimeMinister class and a Driver class. Prime Ministers have first and last names, and the year they were first elected. The natural sorting method for Prime Ministers is by their surnames ascending, then by their first names ascending, if the last names are the same. a. Create a class called BinarySearch. Within this class, create a method that will called binarySearch search an array for a given Prime Minister and return the index they were found at. Although, we are searching for PrimeMinisters, your class and method should be able to search any array of sortable objects. That is, your BinarySearch class should have no direct association with the PrimeMinister class. (You must program the recursive binary search algorithm yourself. Do not use any built in search libraries) b. Make any changes necessary to the PrimeMinister class to be able to search an array of them. c.Fix the issues in the driver class that will prevent your code from running properly. Do not change the declaration of the array. You should get the following output when the driver is run. Macdonald, John A was elected Prime Minister in 1867 Laurier, Wilfred was elected Prime Minister in 1896 Sorry. McGee, Thomas D'Arcy has never been Prime Minister
Alert dont submit
Provided are a PrimeMinister class and a Driver class. Prime Ministers have first and last names, and the year they were first elected. The natural sorting method for Prime Ministers is by their surnames ascending, then by their first names ascending, if the last names are the same. a. Create a class called BinarySearch. Within this class, create a method that will called binarySearch search an array for a given Prime Minister and return the index they were found at. Although, we are searching for PrimeMinisters, your class and method should be able to search any array of sortable objects. That is, your BinarySearch class should have no direct association with the PrimeMinister class. (You must
Step by step
Solved in 4 steps with 4 images
