Need help with these questions. Add your tests to the main() method. #1: Implement a binary search on an array iteratively using the method public static > boolean inArrayIterativeSorted(T[] anArray, T anEntry) #2: Consider a revised selection sort algorithm so that on each pass it finds both the largest and smallest values in the unsorted portion of the array. The sort then moves each of these values into its correct location by swapping array entries. 1. Implement the modified selection sort using the method public static > void modifiedSelectionSort(T[] a, int n) 2. How many comparisons are necessary to sort n values? Here is the java file: import java.util.* ; public class P5 { public static void main(String[] args) { // Add you tests here } // Problem 1 public static > boolean inArrayIterativeSorted(T[] anArray, T anEntry) { } // Problem 2 public static > void modifiedSelectionSort(T[] a, int n) { } // For problem 2, how many comparisons are necessary to sort n values? Write your answer below }
Need help with these questions.
Add your tests to the main() method.
#1: Implement a binary search on an array iteratively using the method public static > boolean inArrayIterativeSorted(T[] anArray, T anEntry)
#2: Consider a revised selection sort
1. Implement the modified selection sort using the method public static > void modifiedSelectionSort(T[] a, int n)
2. How many comparisons are necessary to sort n values?
Here is the java file:
import java.util.* ;
public class P5
{
public static void main(String[] args) {
// Add you tests here
}
// Problem 1
public static <T extends Comparable<? super T>>
boolean inArrayIterativeSorted(T[] anArray, T anEntry) {
}
// Problem 2
public static <T extends Comparable<? super T>> void modifiedSelectionSort(T[] a, int n) {
}
// For problem 2, how many comparisons are necessary to sort n values? Write your answer below
}
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 4 images
