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

Add more tests (#3601)

Browse Source
This commit is contained in:
Debasish Biswas
2022-10-25 17:45:41 +05:30
committed by GitHub
parent 6235fd6505
commit 315e947c87
4 changed files with 125 additions and 66 deletions
Download Patch File Download Diff File Expand all files Collapse all files

39
src/test/java/com/thealgorithms/divideandconquer/BinaryExponentiationTest.java Normal file
View File

@ -0,0 +1,39 @@
package com.thealgorithms.divideandconquer;
import static org.junit.jupiter.api.Assertions.*;
import org.junit.jupiter.api.Test;
public class BinaryExponentiationTest {
@Test
public void testCalculatePower() {
assertEquals(1, BinaryExponentiation.calculatePower(1, 10000000));
assertEquals(1, BinaryExponentiation.calculatePower(1, 100000000));
assertEquals(1, BinaryExponentiation.calculatePower(1, 1000000000));
assertEquals(1, BinaryExponentiation.calculatePower(1, 10000000000L));
assertEquals(1, BinaryExponentiation.calculatePower(1, 100000000000L));
assertEquals(1, BinaryExponentiation.calculatePower(1, 1000000000000L));
assertEquals(1, BinaryExponentiation.calculatePower(1, 10000000000000L));
assertEquals(1, BinaryExponentiation.calculatePower(1, 100000000000000L));
assertEquals(1, BinaryExponentiation.calculatePower(1, 1000000000000000L));
assertEquals(1, BinaryExponentiation.calculatePower(1, 10000000000000000L));
assertEquals(1, BinaryExponentiation.calculatePower(1, 100000000000000000L));
}
@Test
public void testPower() {
assertEquals(1, new BinaryExponentiation().power(1, 10000000));
assertEquals(1, new BinaryExponentiation().power(1, 100000000));
assertEquals(1, new BinaryExponentiation().power(1, 1000000000));
assertEquals(1, new BinaryExponentiation().power(1, 10000000000L));
assertEquals(1, new BinaryExponentiation().power(1, 100000000000L));
assertEquals(1, new BinaryExponentiation().power(1, 1000000000000L));
assertEquals(1, new BinaryExponentiation().power(1, 10000000000000L));
assertEquals(1, new BinaryExponentiation().power(1, 100000000000000L));
assertEquals(1, new BinaryExponentiation().power(1, 1000000000000000L));
assertEquals(1, new BinaryExponentiation().power(1, 10000000000000000L));
assertEquals(1, new BinaryExponentiation().power(1, 100000000000000000L));
}
}

42
src/test/java/com/thealgorithms/divideandconquer/StrassenMatrixMultiplicationTest.java Normal file
View File

@ -0,0 +1,42 @@
package com.thealgorithms.divideandconquer;
import static org.junit.jupiter.api.Assertions.*;
import org.junit.jupiter.api.Test;
class StrassenMatrixMultiplicationTest {
StrassenMatrixMultiplication SMM = new StrassenMatrixMultiplication();
// Strassen Matrix Multiplication can only be allplied to matrices of size 2^n
// and has to be a Square Matrix
@Test
public void StrassenMatrixMultiplicationTest2x2() {
int[][] A = { { 1, 2 }, { 3, 4 } };
int[][] B = { { 5, 6 }, { 7, 8 } };
int[][] expResult = { { 19, 22 }, { 43, 50 } };
int[][] actResult = SMM.multiply(A, B);
assertArrayEquals(expResult, actResult);
}
@Test
void StrassenMatrixMultiplicationTest4x4() {
int[][] A = { { 1, 2, 5, 4 }, { 9, 3, 0, 6 }, { 4, 6, 3, 1 }, { 0, 2, 0, 6 } };
int[][] B = { { 1, 0, 4, 1 }, { 1, 2, 0, 2 }, { 0, 3, 1, 3 }, { 1, 8, 1, 2 } };
int[][] expResult = { { 7, 51, 13, 28 }, { 18, 54, 42, 27 }, { 11, 29, 20, 27 }, { 8, 52, 6, 16 } };
int[][] actResult = SMM.multiply(A, B);
assertArrayEquals(expResult, actResult);
}
@Test
void StrassenMatrixMultiplicationTestNegetiveNumber4x4() {
int[][] A = { { 1, 2, 3, 4 }, { 5, 6, 7, 8 }, { 9, 10, 11, 12 }, { 13, 14, 15, 16 } };
int[][] B = { { 1, -2, -3, 4 }, { 4, -3, -2, 1 }, { 5, -6, -7, 8 }, { 8, -7, -6, -5 } };
int[][] expResult = { { 56, -54, -52, 10 }, { 128, -126, -124, 42 }, { 200, -198, -196, 74 },
{ 272, -270, -268, 106 } };
int[][] actResult = SMM.multiply(A, B);
assertArrayEquals(expResult, actResult);
}
}