diff options
author | Haidong Ji | 2018-09-07 09:14:57 -0500 |
---|---|---|
committer | Haidong Ji | 2018-09-07 09:14:57 -0500 |
commit | 42fe007dab117b7bf68ca8d3e8401dff606bcf85 (patch) | |
tree | 7635246e5658062122318ce69729bfe6fe0abda0 /AlgoDesignAndTechniqueEdxJava/tests | |
parent | bddfc348f5dbf69c004049f74939f2c837cca945 (diff) |
Stress tested according to week 1 pdf, found and fixed bug!
The bug was simple: I picked the index of the sortedAscendingIndex, not
its value in weight comparison.
Diffstat (limited to 'AlgoDesignAndTechniqueEdxJava/tests')
-rw-r--r-- | AlgoDesignAndTechniqueEdxJava/tests/FractionalKnapsackTest.java | 70 |
1 files changed, 63 insertions, 7 deletions
diff --git a/AlgoDesignAndTechniqueEdxJava/tests/FractionalKnapsackTest.java b/AlgoDesignAndTechniqueEdxJava/tests/FractionalKnapsackTest.java index 54dd4f7..6215219 100644 --- a/AlgoDesignAndTechniqueEdxJava/tests/FractionalKnapsackTest.java +++ b/AlgoDesignAndTechniqueEdxJava/tests/FractionalKnapsackTest.java @@ -5,27 +5,83 @@ import org.junit.jupiter.api.Test; class FractionalKnapsackTest { @Test - void test1() { + void testGetSortedIndexArray() { + int[] values = new int[] { 60, 100, 120 }; + int[] weights = new int[] { 20, 50, 30 }; + int[] sortedIndexArray = new int[] { 1, 0, 2 }; + assertArrayEquals(sortedIndexArray, FractionalKnapsack.getSortedIndexArray(values, weights)); + } + + @Test + void testGetBestItem1() { + int[] values = new int[] { 60, 100, 120 }; + int[] weights = new int[] { 20, 50, 30 }; + assertEquals(2, FractionalKnapsack.getBestItem(values, weights)); + } + + @Test + void testGetBestItem2() { + int[] values = new int[] { 500 }; + int[] weights = new int[] { 30 }; + assertEquals(0, FractionalKnapsack.getBestItem(values, weights)); + } + + @Test + void testNaive1() { int[] values = new int[] { 60, 100, 120 }; int[] weights = new int[] { 20, 50, 30 }; int capacity = 50; - assertEquals(180.0000, FractionalKnapsack.getOptimalValue(capacity, values, weights)); + assertEquals(180.0000, FractionalKnapsack.getOptimalValueNaive(capacity, values, weights)); } + @Test - void test2() { + void testNaive2() { + int[] values = new int[] { 500 }; + int[] weights = new int[] { 30 }; + int capacity = 10; + assertEquals(166.6667, FractionalKnapsack.getOptimalValueNaive(capacity, values, weights), 0.0001); + } + + @Test + void test1() { int[] values = new int[] { 60, 100, 120 }; int[] weights = new int[] { 20, 50, 30 }; - int[] sortedIndexArray = new int[] { 1, 0, 2 }; - assertArrayEquals(sortedIndexArray, FractionalKnapsack.getSortedIndexArray(values, weights)); + int capacity = 50; + assertEquals(180.0000, FractionalKnapsack.getOptimalValue(capacity, values, weights)); } + @Test - void test3() { - int[] values = new int[] { 500}; + void test2() { + int[] values = new int[] { 500 }; int[] weights = new int[] { 30 }; int capacity = 10; assertEquals(166.6667, FractionalKnapsack.getOptimalValue(capacity, values, weights), 0.0001); } + @Test + void testStress1() { + int[] values = new int[] { 11, 43, 4, 35, 21 }; + int[] weights = new int[] { 45, 11, 40, 19, 10 }; + int capacity = 50; + assertEquals(101.4444, FractionalKnapsack.getOptimalValue(capacity, values, weights), 0.0001); + } + + @Test + void testStress2() { + int[] values = new int[] { 11, 43, 4, 35, 21 }; + int[] weights = new int[] { 45, 11, 40, 19, 10 }; + int capacity = 50; + assertEquals(101.4444, FractionalKnapsack.getOptimalValueNaive(capacity, values, weights), 0.0001); + } + + @Test + void testStress3() { + int[] values = new int[] { 44, 26, 31 }; + int[] weights = new int[] { 6, 28, 38 }; + int capacity = 50; + assertEquals(83.0526, FractionalKnapsack.getOptimalValue(capacity, values, weights), 0.0001); + } + } |