Add recursion code

Author: jbee37142

src/test/java/algorithm/recursion/BraceCombination.java

@@ -21,7 +21,7 @@ public void test() {
         List<String> actual = new ArrayList<>();
         actual.add("(())");
         actual.add("()()");
-        assertThat(actual, is(괄호경우의수구하기(2)));
+        assertThat(괄호경우의수구하기(2), is(actual));
     }
 
     public List<String> 괄호경우의수구하기(int n) {

src/test/java/algorithm/recursion/Dice.java

@@ -14,12 +14,12 @@ public class Dice {
 
     @Test
     public void test() {
-        assertThat(4, is(calcDiceCase(3)));
-        assertThat(8, is(calcDiceCase(4)));
-        assertThat(16, is(calcDiceCase(5)));
-        assertThat(32, is(calcDiceCase(6)));
-        assertThat(63, is(calcDiceCase(7)));
-        assertThat(125, is(calcDiceCase(8)));
+        assertThat(calcDiceCase(3), is(4));
+        assertThat(calcDiceCase(4), is(8));
+        assertThat(calcDiceCase(5), is(16));
+        assertThat(calcDiceCase(6), is(32));
+        assertThat(calcDiceCase(7), is(63));
+        assertThat(calcDiceCase(8), is(125));
     }
 
     public int calcDiceCase(int n) {

src/test/java/algorithm/recursion/Fibonacci.java

@@ -13,9 +13,9 @@ public class Fibonacci {
      */
     @Test
     public void test() {
-        assertThat(5, is(calcFibo(5)));
-        assertThat(8, is(calcFibo(6)));
-        assertThat(13, is(calcFibo(7)));
+        assertThat(calcFibo(5), is(5));
+        assertThat(calcFibo(6), is(8));
+        assertThat(calcFibo(7), is(13));
     }
 
     public int calcFibo(int num) {

src/test/java/algorithm/recursion/NBitWays.java

@@ -22,7 +22,7 @@ public void test() {
         actual1.add("01");
         actual1.add("10");
         actual1.add("11");
-        assertThat(actual1, is(calcBitCombination(2)));
+        assertThat(calcBitCombination(2), is(actual1));
 
         List<String> actual2 = new ArrayList<>();
         actual2.add("000");
@@ -33,7 +33,7 @@ public void test() {
         actual2.add("101");
         actual2.add("110");
         actual2.add("111");
-        assertThat(actual2, is(calcBitCombination(3)));
+        assertThat(calcBitCombination(3), is(actual2));
     }
 
     public List<String> calcBitCombination(int n) {

src/test/java/algorithm/recursion/Permutation.java

@@ -25,7 +25,7 @@ public void test() {
         actual.add("231");
         actual.add("312");
         actual.add("321");
-        assertThat(actual, is(calcPermutation("123")));
+        assertThat(calcPermutation("123"), is(actual));
     }
 
     public List<String> calcPermutation(String str) {