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 }

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

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 <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

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 4 images

Blurred answer
Knowledge Booster
Arrays
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education