Add sort code

jbee37142 · jbee37142 · commit 2ceb698de0aa · 2017-06-01T10:24:56.000+09:00
diff --git a/src/test/java/sort/BubbleSort.java b/src/test/java/sort/BubbleSort.java
@@ -0,0 +1,43 @@
+package sort;
+
+import org.junit.Test;
+
+import static org.hamcrest.CoreMatchers.is;
+import static org.junit.Assert.assertThat;
+
+public class BubbleSort {
+
+    /*
+        TASK
+        bubble sort를 구현한다.
+     */
+
+    @Test
+    public void test() {
+        int[] arr = new int[5];
+        arr[0] = 2;
+        arr[1] = 1;
+        arr[2] = 4;
+        arr[3] = 0;
+        arr[4] = 3;
+
+        int[] sortedArr = new int[arr.length];
+        for (int i = 0; i < sortedArr.length; i++) {
+            sortedArr[i] = i;
+        }
+        assertThat(sort(arr), is(sortedArr));
+    }
+
+    public int[] sort(int[] arr) {
+        for (int i = 0; i < arr.length - 1; i++) {
+            for (int j = i + 1; j < arr.length; j++) {
+                if (arr[i] > arr[j]) {
+                    int temp = arr[i];
+                    arr[i] = arr[j];
+                    arr[j] = temp;
+                }
+            }
+        }
+        return arr;
+    }
+}
diff --git a/src/test/java/sort/RadixSort.java b/src/test/java/sort/RadixSort.java
@@ -0,0 +1,48 @@
+package sort;
+
+import org.junit.Test;
+
+import static org.hamcrest.CoreMatchers.is;
+import static org.junit.Assert.assertThat;
+
+public class RadixSort {
+
+    /*
+        TASK
+        radix sort를 구현한다.
+     */
+
+    @Test
+    public void test() {
+        int[] arr = new int[5];
+        arr[0] = 52;
+        arr[1] = 31;
+        arr[2] = 24;
+        arr[3] = 45;
+        arr[4] = 13;
+
+        int[] sortedArr = new int[arr.length];
+        sortedArr[0] = 13;
+        sortedArr[1] = 24;
+        sortedArr[2] = 31;
+        sortedArr[3] = 45;
+        sortedArr[4] = 52;
+        assertThat(sort(arr), is(sortedArr));
+    }
+
+    public int[] sort(int[] arr) {
+        int[] newArr = new int[100];
+        int[] result = new int[arr.length];
+        for (int item : arr) {
+            newArr[item] = item;
+        }
+        int index = 0;
+        for (int item : newArr) {
+            if (item != 0) {
+                result[index++] = item;
+            }
+        }
+        return result;
+    }
+
+}
