Question

Directions: Follow the instructions below to explore sorting objects using boxes below. You will sort the boxes by the largest volume.

1. Copy and Paste the Box method below into BlueJ

public class Box

{

private double length, height, depth;

  

public Box( double length, double height, double depth )

{

this.length = length;

this.height = height;

this.depth = depth;

}

  

public double volume()

{

return length*height*depth;

}

// compare this Box to another Box

int compareTo( Box other )

{

  

//Insert code requested in #2 here

}

  

public String toString()

{

return( "length: " + length + ", height: " + height + ", depth: " + depth + ", volume: " + volume() );

}

  

}

1. Compare the Box that is running the method with other. Return a negative integer, zero, or a positive integer, when the Box is less than, equal, or greater than other.
2. Save what you have so far as Box.java
3. Copy and paste the following code into BlueJ

public class BoxSort

{

// Sort an array of Box

public static void selectionSort( Box[] array )

{

// Find the object reference that should go in each cell of

// the array, from cell 0 to the end

for ( int j=0; j < array.length-1; j++ )

{

// Find min: the index of the reference that should go into cell j.

// Look through the unsorted references (those at j or higher)

int min = j;

for ( int k=j+1; k < array.length; k++ )

if ( array[k].compareTo( array[min] ) < 0 ) min = k;

// Swap the reference at j with the reference at min

Box temp = array[j];

array[j] = array[min];

array[min] = temp;

}

}

  

public static void main ( String[] args )

{

Box[] boxArray =

{ new Box( 1.0, 2.3, 2.7), new Box( 1.0, 4.9, 3.2), new Box( 3.0, 1.3, 2.7),

new Box( 3.0, 0.1, 4.67), new Box( 1.3, 1.3, 1.3), new Box( 4.0, 2.3, 1.7),

new Box( 2.2, 2.1, 1.67), new Box( 2.3, 7.3, 6.3), new Box( 2.0, 3.3, 5.3)

};

  

// print out the array

System.out.println("Before: ");

for ( Box box : boxArray )

System.out.println( box );

System.out.println( );

  

// sort the array

selectionSort( boxArray );

  

// print out the array

System.out.println("After: ");

for ( Box box : boxArray )

System.out.println( box );

System.out.println( );

   }

}

1. Save what you created in the previous step as BoxSort.java in the same subdirectory as Box.java. Compile and run as usual.
2. Modify BoxSort above to use the sort method.
3. Why do these two files work so well together? Type your answer in the comment box when you turn in the assignment.

Answer 1

Note: Could you plz go through this code and let me know if u need any changes in this.Thank You
=================================

// Box.java

public class Box

{

   private double length, height, depth;

   public Box(double length, double height, double depth)

   {

       this.length = length;

       this.height = height;

       this.depth = depth;

   }

   public double volume()

   {

       return length * height * depth;

   }

   // compare this Box to another Box

   int compareTo(Box other)

   {
       // Insert code requested in #2 here
       double vol=volume();
       double othVol=other.volume();
       if(vol<othVol)
           return -1;
       else if(vol>othVol)
           return 1;
       else
           return 0;

   }

   public String toString()

   {

       return ("length: " + length + ", height: " + height + ", depth: "
               + depth + ", volume: " + volume());

   }

}

===============================

// BoxSort.java

public class BoxSort

{

   // Sort an array of Box

   public static void selectionSort(Box[] array)

   {

       // Find the object reference that should go in each cell of

       // the array, from cell 0 to the end

       for (int j = 0; j < array.length - 1; j++)

       {

           // Find min: the index of the reference that should go into cell j.

           // Look through the unsorted references (those at j or higher)

           int min = j;

           for (int k = j + 1; k < array.length; k++)

               if (array[k].compareTo(array[min]) < 0)
                   min = k;

           // Swap the reference at j with the reference at min

           Box temp = array[j];

           array[j] = array[min];

           array[min] = temp;

       }

   }

   public static void main(String[] args)

   {

       Box[] boxArray =

       { new Box(1.0, 2.3, 2.7), new Box(1.0, 4.9, 3.2),
               new Box(3.0, 1.3, 2.7),

               new Box(3.0, 0.1, 4.67), new Box(1.3, 1.3, 1.3),
               new Box(4.0, 2.3, 1.7),

               new Box(2.2, 2.1, 1.67), new Box(2.3, 7.3, 6.3),
               new Box(2.0, 3.3, 5.3)

       };

       // print out the array

       System.out.println("Before: ");

       for (Box box : boxArray)

           System.out.println(box);

       System.out.println();

       // sort the array

       selectionSort(boxArray);

       // print out the array

       System.out.println("After: ");

       for (Box box : boxArray)

           System.out.println(box);

       System.out.println();

   }

}

====================================

output:

Before:
length: 1.0, height: 2.3, depth: 2.7, volume: 6.21
length: 1.0, height: 4.9, depth: 3.2, volume: 15.680000000000001
length: 3.0, height: 1.3, depth: 2.7, volume: 10.530000000000001
length: 3.0, height: 0.1, depth: 4.67, volume: 1.4010000000000002
length: 1.3, height: 1.3, depth: 1.3, volume: 2.1970000000000005
length: 4.0, height: 2.3, depth: 1.7, volume: 15.639999999999999
length: 2.2, height: 2.1, depth: 1.67, volume: 7.715400000000002
length: 2.3, height: 7.3, depth: 6.3, volume: 105.77699999999999
length: 2.0, height: 3.3, depth: 5.3, volume: 34.98

After:
length: 3.0, height: 0.1, depth: 4.67, volume: 1.4010000000000002
length: 1.3, height: 1.3, depth: 1.3, volume: 2.1970000000000005
length: 1.0, height: 2.3, depth: 2.7, volume: 6.21
length: 2.2, height: 2.1, depth: 1.67, volume: 7.715400000000002
length: 3.0, height: 1.3, depth: 2.7, volume: 10.530000000000001
length: 4.0, height: 2.3, depth: 1.7, volume: 15.639999999999999
length: 1.0, height: 4.9, depth: 3.2, volume: 15.680000000000001
length: 2.0, height: 3.3, depth: 5.3, volume: 34.98
length: 2.3, height: 7.3, depth: 6.3, volume: 105.77699999999999

=====================Could you plz rate me well.Thank You