You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
48 lines
1.2 KiB
Java
48 lines
1.2 KiB
Java
package _12._1.lukas;
|
|
|
|
import org.junit.jupiter.api.Assertions;
|
|
import org.junit.jupiter.api.Test;
|
|
import provided._12._1.Fibonacci;
|
|
|
|
import java.util.Map;
|
|
|
|
public class FibonacciTest {
|
|
private static final Map<Integer, Long> NUMBERS = Map.ofEntries(
|
|
Map.entry(3, 2L),
|
|
Map.entry(5, 5L),
|
|
Map.entry(8, 21L),
|
|
Map.entry(12, 144L),
|
|
Map.entry(9, 34L),
|
|
Map.entry(18, 2584L),
|
|
Map.entry(15, 610L),
|
|
Map.entry(10, 55L),
|
|
Map.entry(7, 13L),
|
|
Map.entry(11, 89L),
|
|
Map.entry(20, 6765L)
|
|
);
|
|
|
|
@Test
|
|
void recursive() {
|
|
Fibonacci calculator = new FibonacciRecursive();
|
|
NUMBERS.forEach((n, fn) -> Assertions.assertEquals(fn.longValue(), calculator.calculate(n)));
|
|
}
|
|
|
|
@Test
|
|
void parallelRecursive() {
|
|
Fibonacci calculator = new FibonacciParallelRecursive();
|
|
NUMBERS.forEach((n, fn) -> Assertions.assertEquals(fn.longValue(), calculator.calculate(n)));
|
|
}
|
|
|
|
@Test
|
|
void dynamic() {
|
|
Fibonacci calculator = new FibonacciDynamic();
|
|
NUMBERS.forEach((n, fn) -> Assertions.assertEquals(fn.longValue(), calculator.calculate(n)));
|
|
}
|
|
|
|
@Test
|
|
void parallelDynamic() {
|
|
Fibonacci calculator = new FibonacciParallelDynamic();
|
|
NUMBERS.forEach((n, fn) -> Assertions.assertEquals(fn.longValue(), calculator.calculate(n)));
|
|
}
|
|
}
|