We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent a28c364 commit e6728c0Copy full SHA for e6728c0
src/test/java/com/thealgorithms/maths/EulerMethodTest.java
@@ -73,7 +73,6 @@ public void testEulerFullNegativeStepSize() {
73
public void testEulerFullSingleStep() {
74
BiFunction<Double, Double, Double> equation = (x, y) -> x + y;
75
ArrayList<double[]> result = EulerMethod.eulerFull(0, 0.1, 0.1, 1, equation);
76
-
77
assertEquals(2, result.size(), "Incorrect number of points for single step.");
78
assertArrayEquals(new double[] {0.0, 1.0}, result.get(0), 1e-9, "Incorrect first point.");
79
assertArrayEquals(new double[] {0.1, 1.1}, result.get(1), 1e-9, "Incorrect second point.");
0 commit comments