algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-10 21:43:15 +08:00
Code Issues Packages Projects Releases Wiki Activity

Create BucketSortTest (#3779)

Browse Source 
* Create BucketSortTest

* Update src/test/java/com/thealgorithms/sorts/BucketSortTest.java

Co-authored-by: Debasish Biswas <debasishbsws.abc@gmail.com>

Co-authored-by: Debasish Biswas <debasishbsws.abc@gmail.com>
This commit is contained in:
Hyun
2022-11-28 18:45:06 +09:00
committed by GitHub
parent 27fc872edb
commit 6c9090ffed
2 changed files with 51 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
src/main/java/com/thealgorithms/sorts/BucketSort.java
View File

@ -32,7 +32,7 @@ public class BucketSort {
* *
* @param arr the array contains elements * @param arr the array contains elements
*/ */
private static void bucketSort(int[] arr) { public static int[] bucketSort(int[] arr) {
/* get max value of arr */ /* get max value of arr */
int max = max(arr); int max = max(arr);
@ -67,6 +67,8 @@ public class BucketSort {
arr[index++] = value; arr[index++] = value;
} }
} }
return arr;
} }
/** /**

48
src/test/java/com/thealgorithms/sorts/BucketSortTest.java Normal file
View File

@ -0,0 +1,48 @@
package com.thealgorithms.sorts;
import static org.junit.jupiter.api.Assertions.assertArrayEquals;
import org.junit.jupiter.api.Test;
public class BucketSortTest {
@Test
public void bucketSortSingleIntegerArray() {
int[] inputArray = { 4 };
int[] outputArray = BucketSort.bucketSort(inputArray);
int[] expectedOutput = { 4 };
assertArrayEquals(outputArray, expectedOutput);
}
@Test
public void bucketSortNonDuplicateIntegerArray() {
int[] inputArray = { 6, 1, 99, 27, 15, 23, 36 };
int[] outputArray = BucketSort.bucketSort(inputArray);
int[] expectedOutput = {1, 6, 15, 23, 27, 36, 99};
assertArrayEquals(outputArray, expectedOutput);
}
@Test
public void bucketSortDuplicateIntegerArray() {
int[] inputArray = { 6, 1, 27, 15, 23, 27, 36, 23 };
int[] outputArray = BucketSort.bucketSort(inputArray);
int[] expectedOutput = {1, 6, 15, 23, 23, 27, 27, 36};
assertArrayEquals(outputArray, expectedOutput);
}
@Test
public void bucketSortNonDuplicateIntegerArrayWithNegativeNum() {
int[] inputArray = { 6, -1, 99, 27, -15, 23, -36 };
int[] outputArray = BucketSort.bucketSort(inputArray);
int[] expectedOutput = { -36, -15, -1, 6, 23, 27, 99};
assertArrayEquals(outputArray, expectedOutput);
}
@Test
public void bucketSortDuplicateIntegerArrayWithNegativeNum() {
int[] inputArray = { 6, -1, 27, -15, 23, 27, -36, 23 };
int[] outputArray = BucketSort.bucketSort(inputArray);
int[] expectedOutput = { -36, -15, -1, 6, 23, 23, 27, 27};
assertArrayEquals(outputArray, expectedOutput);
}
}