Refactored by: rd122 ym67

src/Bins.java

@@ -1,4 +1,5 @@
 import java.util.ArrayList;
+import java.util.Collections;
 import java.util.List;
 import java.util.Scanner;
 
@@ -9,10 +10,8 @@
 public class Bins {
     public static final String DATA_FILE = "example.txt";
     // all possible algorithms to compare --- add new instances here!
-    private static WorstFitAlgorithm algortihmsToCompare[] = { 
-        new WorstFitAlgorithm(),
-        new WorstFitDecreasingAlgorithm()
-    };
+
+    private static WorstFitAlgorithm myAlgorithm;
 
 
     /**
@@ -49,9 +48,18 @@ public static void main (String args[]) {
         Scanner input = new Scanner(Bins.class.getClassLoader().getResourceAsStream(DATA_FILE));
         List<Integer> data = b.readData(input);
         System.out.println("total size = " + b.getTotal(data) / 1000000.0 + "GB");
-
-        for (WorstFitAlgorithm al : algortihmsToCompare) {
-            al.fitDisksAndPrint(data);
-        }
+
+        myAlgorithm = new WorstFitAlgorithm();
+
+        //do nothing: Worst Fit Algorithm
+        myAlgorithm.fitDisksAndPrint(data, "Worst Fit Algorithm",(list)->{
+
+        });
+
+        //sort in reverse order: Worst Fit Algorithm Decreasing
+        myAlgorithm.fitDisksAndPrint(data, "Worst Fit Algorithm Decreasing",(list)->{
+        	Collections.sort(list, Collections.reverseOrder());
+        });
+
     }
 }

src/WorstFitAlgorithm.java

@@ -2,6 +2,7 @@
 import java.util.Collection;
 import java.util.List;
 import java.util.PriorityQueue;
+import java.util.function.Consumer;
 
 /**
  * This class represents worst-fit algorithms for allocating files to disks.
@@ -10,32 +11,23 @@
  */
 public class WorstFitAlgorithm {
     public static final String WORST_FIT_METHOD = "worst-fit";
-    private String myDescription;
 
     /**
      * Default constructor
      */
     public WorstFitAlgorithm () {
-        this(WORST_FIT_METHOD);
-    }
-
-    /**
-     * Create with given descriptor.
-     */
-    public WorstFitAlgorithm (String description) {
-        myDescription = description;
     }
 
     /**
      * Allocates given files to the fewest number of disks.
      *
      * @param data collection of files to be allocated to disks
      */
-    public void fitDisksAndPrint (List<Integer> data) {
+    public void fitDisksAndPrint (List<Integer> data, String name, Consumer<List<?>> processor) {
         List<Integer> copy = new ArrayList<>(data);
-        organizeData(copy);
+        processor.accept(copy);
         Collection<Disk> disks = addFiles(copy);
-        printResults(disks, myDescription);
+        printResults(disks, name);
     }
 
     /**