forked from jbee37142/algorithm_basic_java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathRadixSort.java
More file actions
48 lines (40 loc) · 998 Bytes
/
RadixSort.java
File metadata and controls
48 lines (40 loc) · 998 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
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;
}
}