Skip to content

test(searches): cover null input cases in IterativeBinarySearch #7375

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
nickzerjeski wants to merge 1 commit into
base: master
Choose a base branch
from
+20 −0
Open

test(searches): cover null input cases in IterativeBinarySearch #7375

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
20 changes: 20 additions & 0 deletions src/test/java/com/thealgorithms/searches/IterativeBinarySearchTest.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -87,6 +87,26 @@ void testBinarySearchEmptyArray() {
assertEquals(-1, binarySearch.find(array, key), "The element should not be found in an empty array.");
}

/**
* Test for binary search with a null array.
*/
@Test
void testBinarySearchNullArray() {
IterativeBinarySearch binarySearch = new IterativeBinarySearch();
Integer key = 1;
assertEquals(-1, binarySearch.find(null, key), "The element should not be found in a null array.");
}

/**
* Test for binary search with a null key.
*/
@Test
void testBinarySearchNullKey() {
IterativeBinarySearch binarySearch = new IterativeBinarySearch();
Integer[] array = {1, 2, 4, 8, 16};
assertEquals(-1, binarySearch.find(array, null), "A null search key should return -1.");
}

/**
* Test for binary search on a large array.
*/
Expand Down
Loading