Question

Objective: in Java

Write a program that implements 3 sorting algorithms and times them in real time. These algorithms will sort Cylinders by their volume. First, download the driver and include it in your project.

Write a class Cylinder with the following properties

• baseRadius: a non-negative number that corresponds to the Cylinder’s base’s radius.
• height: a non-negative number that corresponds to the Cylinder’s height.

Next, write a class Sorter with the following

• bubbleSort: This static method takes in an array of Cylinders via a parameter and sorts it based on the bubble sort algorithm. This method also should not return anything.
• mergeSort: This static methods takes in an array of Cylinders via a parameter and sorts it based on the merge sort algorithm. This method also should not return anything.
• heapSort: This static method takes in an array of Cylinders via a parameter and sorts it based on the heap sort algorithm.
  • HINT: The way heap sort works is you insert all the values into a heap first, and then you remove them all from the heap.
  • HINT: You may want to have another static array of Cylinders for the heap and a static integer for the last index.

Example Output:

Cylinder Sorter!

Sorted correctly? true

It took 313ms for bubble sort

Sorted correctly? true

It took 15ms for merge sort

Sorted correctly? true

It took 16ms for heap sort

Driver:

import java.util.*;
public class SortingTester {

        public static void main(String[] args) {
                System.out.println("Cylinder Sorter!");
                
                Cylinder[] org = makeArray();
                Cylinder[] a = org.clone();
                long beforeTime = System.currentTimeMillis();
                Sorter.bubbleSort(a);
                long afterTime = System.currentTimeMillis();
                System.out.println("Sorted correctly? "+isSortedCorrectly(a));
                System.out.println("It took "+(afterTime-beforeTime)+"ms for bubble sort");
                
                a = org.clone();
                beforeTime = System.currentTimeMillis();
                Sorter.mergeSort(a);
                afterTime = System.currentTimeMillis();
                System.out.println("Sorted correctly? "+isSortedCorrectly(a));
                System.out.println("It took "+(afterTime-beforeTime)+"ms for merge sort");
                
                a = org.clone();
                beforeTime = System.currentTimeMillis();
                Sorter.heapSort(a);
                afterTime = System.currentTimeMillis();         
                System.out.println("Sorted correctly? "+isSortedCorrectly(a));
                System.out.println("It took "+(afterTime-beforeTime)+"ms for heap sort");
                
                
        }
        //Checks to see if array a has been sorted correctly
        public static boolean isSortedCorrectly(Cylinder[] a)
        {
                for(int i=0;ia[i+1].getVolume())
                                return false;
                }
                return true;
        }
        //Creates an array of random cylinders
        public static Cylinder[] makeArray()
        {
                Cylinder[] a = new Cylinder[10000];//A big ole array
                Random r = new Random(100);//fixes the seed at 100
                for(int i=0;i

Answer 1

NOTE: Please upvote if you find this solution useful in any way.

For any doubts or queries, use the comment section below.

NOTE:- I have just taken some random array value instead of cylinder volumes. You can replace the array with your cylinder volumes array.

CODE:

import java.util.*;

class Sorter{
   void bubbleSort(int arr[]){
       int n = arr.length;
for (int i = 0; i < n-1; i++){
for (int j = 0; j < n-i-1; j++){
if (arr[j] > arr[j+1]){
// swap temp and arr[i]
int temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}

   }

   void mergeSort(int arr[], int l, int r){
       if (l < r)
{
// Find the middle point
int m = (l+r)/2;
  
// Sort first and second halves
mergeSort(arr, l, m);
mergeSort(arr , m+1, r);
  
// Merge the sorted halves
merge(arr, l, m, r);
}

   }

   void merge(int arr[], int l, int m, int r)
{
// Find sizes of two subarrays to be merged
int n1 = m - l + 1;
int n2 = r - m;
  
/* Create temp arrays */
int L[] = new int [n1];
int R[] = new int [n2];
  
/*Copy data to temp arrays*/
for (int i=0; i<n1; ++i)
L[i] = arr[l + i];
for (int j=0; j<n2; ++j)
R[j] = arr[m + 1+ j];
  
  
/* Merge the temp arrays */
  
// Initial indexes of first and second subarrays
int i = 0, j = 0;
  
// Initial index of merged subarry array
int k = l;
while (i < n1 && j < n2)
{
if (L[i] <= R[j])
{
arr[k] = L[i];
i++;
}
else
{
arr[k] = R[j];
j++;
}
k++;
}
  
/* Copy remaining elements of L[] if any */
while (i < n1)
{
arr[k] = L[i];
i++;
k++;
}
  
/* Copy remaining elements of R[] if any */
while (j < n2)
{
arr[k] = R[j];
j++;
k++;
}
}

   void heapSort(int arr[]){

       int n = arr.length;
  
// Build heap (rearrange array)
for (int i = n / 2 - 1; i >= 0; i--)
heapify(arr, n, i);
  
// One by one extract an element from heap
for (int i=n-1; i>=0; i--)
{
// Move current root to end
int temp = arr[0];
arr[0] = arr[i];
arr[i] = temp;
  
// call max heapify on the reduced heap
heapify(arr, i, 0);
}
   }

   void heapify(int arr[], int n, int i)
{
int largest = i; // Initialize largest as root
int l = 2*i + 1; // left = 2*i + 1
int r = 2*i + 2; // right = 2*i + 2
  
// If left child is larger than root
if (l < n && arr[l] > arr[largest])
largest = l;
  
// If right child is larger than largest so far
if (r < n && arr[r] > arr[largest])
largest = r;
  
// If largest is not root
if (largest != i)
{
int swap = arr[i];
arr[i] = arr[largest];
arr[largest] = swap;
  
// Recursively heapify the affected sub-tree
heapify(arr, n, largest);
}
}

}
class cylindersorter {

public static void main(String[] args) {
System.out.println("Cylinder Sorter!");
Sorter sorter = new Sorter();

Random rd = new Random();
int[] array = new int[500];

for (int i = 0; i < array.length; i++)
   array[i] = rd.nextInt(); // storing random integers in an array

int[] a = array.clone();

long beforeTime = System.currentTimeMillis();
sorter.bubbleSort(a);
long afterTime = System.currentTimeMillis();
       System.out.println("Sorted correctly? "+isSortedCorrectly(a));
System.out.println("It took "+(afterTime-beforeTime)+"ms for bubble sort");

a = array.clone();
beforeTime = System.currentTimeMillis();
sorter.mergeSort(a,0,a.length-1);
afterTime = System.currentTimeMillis();
System.out.println("Sorted correctly? "+isSortedCorrectly(a));
System.out.println("It took "+(afterTime-beforeTime)+"ms for merge sort");
  
a = array.clone();
beforeTime = System.currentTimeMillis();
sorter.heapSort(a);
afterTime = System.currentTimeMillis();   
System.out.println("Sorted correctly? "+isSortedCorrectly(a));
System.out.println("It took "+(afterTime-beforeTime)+"ms for heap sort");

}

public static boolean isSortedCorrectly(int[] a){
for(int i=0;i<a.length-1;i++){
   if(a[i] > a[i+1])
return false;
}
return true;
}
}

ScreenShots:

-Desktop,kyllsdersorterjava Subllme Text (UNREGISTERED) ieport jaro.urst 3 class Sorter int terp arrl ind the aLdd.c paint

Fri 2325 -Desktop,kyllsdersorterjava Subllme Text (UNREGISTERED) ins1zes or to subarrays to be serged

Fri 2325 -Desktop,kyllsdersorterjava Subllme Text (UNREGISTERED) hespstylarr.n.1l arrl: terp;

Frl 2325 -Desktop,kyllsdersorterjava Subllme Text (UNREGISTERED) sesp ylar,i.ol argest right chitd is argestr t Largest class cylindersorter

Fri 2326 -Desktop,kyllsdersorterjava Subllme Text (UNREGISTERED) ystes ost.print In "yl inder sorter' Sarter arter new Sorter A 135 7 O ist Sprte.out prant int .tartoonrar tatterire teroretzei-wyror,bubie ssrt., long betareTine Systes. currentTineilis1: ang aftertinc -Syatoe.currentt imcMiia Systes.out.print Lniit taok lattertire teroreTinel-s for bubble sort betareTine Systen, currentTineill151 Gyeiee.nst.pr int In "Sarted rorrent +5rlattnrrertlyini Syste "out, printin, "It took .. lattertire teroreTimeド『s ror rerge sort.. ; betareTine Systen, currentTineill1si ter.hassort(a? aftertinc -Syatce.cufrtCMIis yis nst.por int In "Sarled rurre Systes out.print Lni 'it taok latterTire tetoreTinei-'es for hea; sort

Fri 2326 -Desktop,kyllsdersorterjava Subllme Text (UNREGISTERED) L-arrzy.clonel: lang betareTi -Systes.rurrent Tine s1 1sng ùfterline-systee.curreit! İEML11İs(l; Systes ost.print Lni "it took-lattertire teroreTiel-Es for bubble sort babeleiors erter.nergesort:ง.อ.a. Length 1:.: Systeg.ort, printin1"It took ··1stterTire, teroreTimel-"m ror merge 50rt.,; เงิ-satra,.c.uns:(1; belar Tin Sysn.rurrentTirillisi Syste,ort, printin"It took ··1stterTire . teroreTimel-"m tor heap 5ort"); ubic staric boolean is5ortedcorrec:lylint return T

rile reit view Searth Terminal Help tanzeenslangtanzeenalan 380V34 380 4A 300V5A 208448 288A58-Desktops 1avac cylindersorter-1ava Sorted correctty? true it took 11rs for bubble sort t took 28s for reroe sert Sorted correctty? true it took 2rs for heap sert Lan-3ODVSA-355V4A-38OVSA-255MS-2mu. :-/Desktops)- Vi