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

refactor: FindKthNumber (#5374)

Browse Source
This commit is contained in:
Alex Klymenko
2024-08-24 10:53:35 +02:00
committed by GitHub
parent 84fb717509
commit 4e72056527
2 changed files with 103 additions and 56 deletions
Download Patch File Download Diff File Expand all files Collapse all files

59
src/test/java/com/thealgorithms/maths/FindKthNumberTest.java Normal file
View File

@ -0,0 +1,59 @@
package com.thealgorithms.maths;
import static org.junit.jupiter.api.Assertions.assertEquals;
import static org.junit.jupiter.api.Assertions.assertThrows;
import java.util.Arrays;
import java.util.Random;
import org.junit.jupiter.api.Test;
public class FindKthNumberTest {
@Test
public void testFindKthMaxTypicalCases() {
int[] array1 = {3, 2, 1, 4, 5};
assertEquals(3, FindKthNumber.findKthMax(array1, 3));
assertEquals(4, FindKthNumber.findKthMax(array1, 2));
assertEquals(5, FindKthNumber.findKthMax(array1, 1));
int[] array2 = {7, 5, 8, 2, 1, 6};
assertEquals(5, FindKthNumber.findKthMax(array2, 4));
assertEquals(6, FindKthNumber.findKthMax(array2, 3));
assertEquals(8, FindKthNumber.findKthMax(array2, 1));
}
@Test
public void testFindKthMaxEdgeCases() {
int[] array1 = {1};
assertEquals(1, FindKthNumber.findKthMax(array1, 1));
int[] array2 = {5, 3};
assertEquals(5, FindKthNumber.findKthMax(array2, 1));
assertEquals(3, FindKthNumber.findKthMax(array2, 2));
}
@Test
public void testFindKthMaxInvalidK() {
int[] array = {1, 2, 3, 4, 5};
assertThrows(IllegalArgumentException.class, () -> FindKthNumber.findKthMax(array, 0));
assertThrows(IllegalArgumentException.class, () -> FindKthNumber.findKthMax(array, 6));
}
@Test
public void testFindKthMaxLargeArray() {
int[] array = generateArray(1000);
int k = new Random().nextInt(array.length);
int result = FindKthNumber.findKthMax(array, k);
Arrays.sort(array);
assertEquals(array[array.length - k], result);
}
public static int[] generateArray(int capacity) {
int size = new Random().nextInt(capacity) + 1;
int[] array = new int[size];
for (int i = 0; i < size; i++) {
array[i] = new Random().nextInt(100); // Ensure positive values for testing
}
return array;
}
}