Write a method that takes an integer array as its parameter and sorts the contents of the array in ascending order using the Insertion Sort algorithm. Call this method  after the original array (original program below) and other stats have been displayed. Once the array has been sorted by your method, display its contents to the screen in the same manner as the original array was displayed.

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

Write a method that
takes an integer array as its parameter and sorts the contents of the array in
ascending order using the Insertion Sort algorithm. Call this method 
after the original array (original program below) and other stats have been displayed. Once the array has
been sorted by your method, display its contents to the screen in the same
manner as the original array was displayed.

 

import java.util.Random;
import java.util.Scanner;

public class Main {
   public static void main(String[] args) {
      Scanner scnr = new Scanner(System.in);
      System.out.println("How many numbers to store?");
      //input array size
      int size = scnr.nextInt();
      //creating array
      double[] array = new double[size];
      //fill array with random numbers in range 1-999 inclusive
      randomArray(array, size, 1, 999);
      //find smallest, largest and average
      compute(array, size);
   }
    //method to fill array with randoms numbers within range min to max and print them
    private static void randomArray(double[] arr, int n, int min, int max) {
       Random q = new Random();
       for (int i = 0; i < n; i++) {
         arr[i] = q.nextInt((max - min) + 1) + min;
         System.out.print(arr[i] + " ");
      }
    System.out.println();
   }
   //method to print smallest, largest amd average 
    private static void compute(double[] val, int n) {
      //set min to default max value
      double min = Double.MAX_VALUE;
      //set min to default min value
      double max = Double.MIN_VALUE;
      double sum = 0, avg;
      //iterate over array
      for (int i = 0; i < n; i++) {
         //calculate sum
         sum = sum + val[i];
         //set minimum value
         if (val[i] < min)
            min = val[i];
         //set maximum value
         if (val[i] > max)
            max = val[i];
      }
      //calculate average
      avg = sum/n;
      System.out.println("The smallest number = " + min);
      System.out.println("The largest number = " + max);
      System.out.format("The average of numbers = %.4f" , avg);
    }
}

 

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

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
  • SEE MORE 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