Question: Java selection and sort problem. Thanks! Write a program that a. Calls a method that takes two parameters, an integer and an integer array. The
Write a program that a. Calls a method that takes two parameters, an integer and an integer array. The call should perform binary search and should return the index of the integer in the array if found and should return -(insertionPoint+1) if the number is not found. Print out the index in the main method. b. Calls a second method that performs binary search recursively. It should take 4 parameters: 3 integers and an array of integers. It should return the index of the element if found, if not then it should return -1. Write a program that calls a method called selectionSort that accepts an integer array as a parameter and sorts the elements in the array using the selection sort algorithm. Print the array before it is sorted and after it is sorted
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
