This question is in java The Sorts.java file is the sorting program we looked at . You can use either method listed in the example when coding. You want to add to the grades.java and calculations.java files so you put the list in numerical order. Write methods to find the median and the range. Have a toString method that prints the ordered list, the number of items in the list, the mean, median and range. Ex List: 20 , 30 , 40 , 75 , 93 Number of elements: 5 Mean: 51.60 Median: 40 Range: 73     Grades.java is the main file import java.util.Scanner; public class grades  {  public static void main(String[] args)  {      int n;      calculation c = new calculation();      int array[] = new int[20];      System.out.print("Enter number of grades that are to be entered: ");      Scanner scan = new Scanner(System.in);      n = scan.nextInt();      System.out.println("Enter the grades: ");      for(int i=0; i 0 && numbers[position-1] > key)          {             numbers[position] = numbers[position-1];             position--;          } numbers[position] = key;       }    }   }

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

This question is in java

The Sorts.java file is the sorting program we looked at . You can use either method listed in the example when coding.

You want to add to the grades.java and calculations.java files so you put the list in numerical order. Write methods to find the median and the range.

Have a toString method that prints the ordered list, the number of items in the list, the mean, median and range.

Ex

List: 20 , 30 , 40 , 75 , 93
Number of elements: 5
Mean: 51.60
Median: 40
Range: 73

 

 

Grades.java is the main file

import java.util.Scanner;
public class grades 
{
 public static void main(String[] args)
 {
     int n;
     calculation c = new calculation();
     int array[] = new int[20];
     System.out.print("Enter number of grades that are to be entered: ");
     Scanner scan = new Scanner(System.in);
     n = scan.nextInt();
     System.out.println("Enter the grades: ");
     for(int i=0; i<n; i++)
     {
         array[i] = scan.nextInt();
         if(array[i] < 0)
         {
             System.out.println("Invalid: enter again");
             i--;
         }
     }
     System.out.println("\nThe average of your " +n+" grades is "+c.average(array, n));
 }
}

 

 

calculations.java is used to find the average

import java.util.*;
class calculation
{
    double average(int[] arr, int n)
    {
        double av;
        int sum=0;
        for(int i=0; i<n; i++)
        {
            sum = sum + arr[i];
        }
        av = (double)sum / (double) n;
        return av;
    }
}

 

sorts.java is an example file, in which the question asks to use either method from this code.

 

//********************************************************************
//  Sorts.java       Author: Lewis/Loftus/Cocking
//
//  Demonstrates the selection sort and insertion sort algorithms,
//  as well as a generic object sort.
//********************************************************************
public class Sorts
{
   //-----------------------------------------------------------------
   // Sorts the specified array of integers using the selection
   // sort algorithm.
   //-----------------------------------------------------------------
   public static void selectionSort (int[] numbers)
   {
      int min, temp;

      for (int index = 0; index < numbers.length-1; index++)
      {
         min = index;
         for (int scan = index+1; scan < numbers.length; scan++)
            if (numbers[scan] < numbers[min])
               min = scan;

         // Swap the values
         temp = numbers[min];
         numbers[min] = numbers[index];
         numbers[index] = temp;
      }
   }

   //-----------------------------------------------------------------
   //  Sorts the specified array of integers using the insertion
   //  sort algorithm.
   //-----------------------------------------------------------------
   public static void insertionSort (int[] numbers)
   {
      for (int index = 1; index < numbers.length; index++)
      {
         int key = numbers[index];
         int position = index;

         // shift larger values to the right
         while (position > 0 && numbers[position-1] > key)
         {
            numbers[position] = numbers[position-1];
            position--;
         }

numbers[position] = key;
      }
   }

  }

 

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 6 steps with 3 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY