rubythonode
diff --git a/Collapse file
‎README.md‎
Copy file name to clipboardExpand all lines: README.md
+2-4Lines changed: 2 additions & 4 deletions
Display the source diff
Display the rich diff b/Collapse file
‎README.md‎
Copy file name to clipboardExpand all lines: README.md
+2-4Lines changed: 2 additions & 4 deletions
Display the source diff
Display the rich diff
diff --git a/Collapse file
‎src/test/java/exercise/SearchEquilibrium.java‎
Copy file name to clipboardExpand all lines: src/test/java/exercise/SearchEquilibrium.java
+6-10Lines changed: 6 additions & 10 deletions b/Collapse file
‎src/test/java/exercise/SearchEquilibrium.java‎
Copy file name to clipboardExpand all lines: src/test/java/exercise/SearchEquilibrium.java
+6-10Lines changed: 6 additions & 10 deletions
@@ -59,8 +59,7 @@
 
 ---
 
-## Algorithm
-### Sort
+## Sort and Search
 * bubble sort를 구현한다. [code](https://github.com/JaeYeopHan/algorithm_basic_java/blob/master/src/test/java/sort/BubbleSort.java)
 * Insertion sort를 구현한다. [code](https://github.com/JaeYeopHan/algorithm_basic_java/blob/master/src/test/java/sort/InsertionSort.java)
 * Selection sort를 구현한다. [code](https://github.com/JaeYeopHan/algorithm_basic_java/blob/master/src/test/java/sort/SelectionSort.java)
@@ -81,13 +80,12 @@
 </br>
 
 ## 알고리즘 문제 풀어보기
-### Exercise
 
 ### Dynamic Programming
 * Jump game [code](https://github.com/JaeYeopHan/algorithm_basic_java/blob/master/src/test/java/algorithm/dp/JumpGame.java)
 
 ### Others
-* 양 쪽의 합이 동일해지는 index의 값을 구한다. [code]()
+* 주어진 배열에서 양 쪽의 합이 동일해지는 index의 값을 구한다. [code](https://github.com/JaeYeopHan/algorithm_basic_java/blob/master/src/test/java/exercise/SearchEquilibrium.java)
 * n!의 결과값에서 0의 개수를 구한다. [code](https://github.com/JaeYeopHan/algorithm_basic_java/blob/master/src/test/java/exercise/FactorialZeroCount.java)
 * temp 를 사용하지 않고 두 변수를 swap 한다. [code](https://github.com/JaeYeopHan/algorithm_basic_java/blob/master/src/test/java/exercise/NoTempSwapTest.java)
 * 어느날의 월, 일을 입력받아 요일을 반환하는 함수를 구현한다. [code](https://github.com/JaeYeopHan/algorithm_basic_java/blob/master/src/test/java/exercise/CalenderExample.java)
 
@@ -7,18 +7,14 @@
 
 public class SearchEquilibrium {
 
+    /*
+        TASK
+        주어진 배열에서 양 쪽의 합이 동일해지는 index의 값을 구한다.
+     */
+
     @Test
     public void test() {
-        int[] arr = new int[9];
-        arr[0] = -4;
-        arr[1] = 8;
-        arr[2] = 16;
-        arr[3] = -22;
-        arr[4] = 0;
-        arr[5] = -4;
-        arr[6] = 8;
-        arr[7] = 16;
-        arr[8] = -22;
+        int[] arr = {-4, 8, 16, -22, 0, -4, 8, 16, -22};
         assertThat(true, is(solution(arr) == 0 || solution(arr) == 4));
     }