BAEL-3194: Radix Sort in Java (changed the method name to comply with site standards) (eugenp#7761)

vimde · maibin · commit dc1cd98cd01e · 2019-09-10T07:36:37.000-07:00
diff --git a/algorithms-sorting/src/main/java/com/baeldung/algorithms/radixsort/RadixSort.java b/algorithms-sorting/src/main/java/com/baeldung/algorithms/radixsort/RadixSort.java
@@ -29,7 +29,7 @@ private static void applyCountingSortOn(int[] numbers, int placeValue) {
             frequency[digit]++;
         }
 
-        for (int i = 1; i < 10; i++) {
+        for (int i = 1; i < range; i++) {
             frequency[i] += frequency[i - 1];
         }
 
diff --git a/algorithms-sorting/src/test/java/com/baeldung/algorithms/radixsort/RadixSortUnitTest.java b/algorithms-sorting/src/test/java/com/baeldung/algorithms/radixsort/RadixSortUnitTest.java
@@ -7,7 +7,7 @@
 public class RadixSortUnitTest {
 
     @Test
-    public void givenUnsortedArrayWhenRadixSortThenArraySorted() {
+    public void givenUnsortedArray_whenRadixSort_thenArraySorted() {
         int[] numbers = { 387, 468, 134, 123, 68, 221, 769, 37, 7 };
         RadixSort.sort(numbers);
         int[] numbersSorted = { 7, 37, 68, 123, 134, 221, 387, 468, 769 };

Original file line number	Diff line number	Diff line change
`@@ -29,7 +29,7 @@ private static void applyCountingSortOn(int[] numbers, int placeValue) {`
`29`	`29`	`frequency[digit]++;`
`30`	`30`	`}`
`31`	`31`
`32`		`- for (int i = 1; i < 10; i++) {`
	`32`	`+ for (int i = 1; i < range; i++) {`
`33`	`33`	`frequency[i] += frequency[i - 1];`
`34`	`34`	`}`
`35`	`35`