Question

The selection-sort method repeatedly finds the smallest number in the current array and swaps it with the first. Rewrite this program by finding the largest number and swapping it with the last. Write a test program that reads in ten double numbers, invokes the method, and displays the sorted numbers.

Solution

Verified
Answered 1 year ago
Answered 1 year ago
Step 1
1 of 6

We need to implement selectionSort method. We will also need main, enterNumbers and print methods for testing sort.

We need to import Scanner class to handle user input.

import java.util.Scanner;

public class Main {
  // Main method
  public static void main(String[] args) {}

  // Get numbers from the user
  static void enterNumbers(double[] array) {}

  // Sort numbers
  public static void selectionSort(double[] array) {}

  // Print numbers
  public static void print(double[] array) {}
}

Create an account to view solutions

By signing up, you accept Quizlet's Terms of Service and Privacy Policy
Continue with GoogleContinue with Facebook

Create an account to view solutions

By signing up, you accept Quizlet's Terms of Service and Privacy Policy
Continue with GoogleContinue with Facebook

More related questions

1/4

1/7