SquareRootBinarySearchTest.java

packagecom.thealgorithms.searches;

importstaticorg.junit.jupiter.api.Assertions.assertEquals;

importorg.junit.jupiter.api.Test;

classSquareRootBinarySearchTest {

@Test
voidtestPerfectSquare() {
longinput = 16;
longexpected = 4;
assertEquals(expected, SquareRootBinarySearch.squareRoot(input), "Square root of 16 should be 4");
 }

@Test
voidtestNonPerfectSquare() {
longinput = 15;
longexpected = 3;
assertEquals(expected, SquareRootBinarySearch.squareRoot(input), "Square root of 15 should be 3");
 }

@Test
voidtestZero() {
longinput = 0;
longexpected = 0;
assertEquals(expected, SquareRootBinarySearch.squareRoot(input), "Square root of 0 should be 0");
 }

@Test
voidtestOne() {
longinput = 1;
longexpected = 1;
assertEquals(expected, SquareRootBinarySearch.squareRoot(input), "Square root of 1 should be 1");
 }

@Test
voidtestLargeNumberPerfectSquare() {
longinput = 1000000;
longexpected = 1000;
assertEquals(expected, SquareRootBinarySearch.squareRoot(input), "Square root of 1000000 should be 1000");
 }

@Test
voidtestLargeNumberNonPerfectSquare() {
longinput = 999999;
longexpected = 999;
assertEquals(expected, SquareRootBinarySearch.squareRoot(input), "Square root of 999999 should be 999");
 }

@Test
voidtestNegativeInput() {
longinput = -4;
longexpected = 0; // Assuming the implementation should return 0 for negative input
assertEquals(expected, SquareRootBinarySearch.squareRoot(input), "Square root of negative number should return 0");
 }
}