forked from ArinaJur/CodingPracticeLessons
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAscendingSequenceTest.java
More file actions
53 lines (40 loc) · 1.68 KB
/
AscendingSequenceTest.java
File metadata and controls
53 lines (40 loc) · 1.68 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
import org.junit.Assert;
import org.junit.Test;
public class AscendingSequenceTest {
@Test
public void testAscendingArrayHappyPath() {
int startNumber = 1;
int endNumber = 5;
int[] expectedResult = {1, 2, 3, 4, 5};
AscendingSequence ascendingSequence = new AscendingSequence();
int[] actualResult = ascendingSequence.buildAscendingArray(startNumber, endNumber);
Assert.assertArrayEquals(expectedResult, actualResult);
}
@Test
public void testAscendingArrayZeroCase() {
int startNumber = 0;
int endNumber = 5;
int[] expectedResult = {0, 1, 2, 3, 4, 5};
AscendingSequence ascendingSequence = new AscendingSequence();
int[] actualResult = ascendingSequence.buildAscendingArray(startNumber, endNumber);
Assert.assertArrayEquals(expectedResult, actualResult);
}
@Test
public void testAscendingArrayNegativeNumbersCase() {
int startNumber = -8;
int endNumber = -4;
int[] expectedResult = {-8, -7, -6, -5, -4};
AscendingSequence ascendingSequence = new AscendingSequence();
int[] actualResult = ascendingSequence.buildAscendingArray(startNumber, endNumber);
Assert.assertArrayEquals(expectedResult, actualResult);
}
@Test
public void testAscendingArrayNegativePositiveNumbersCase() {
int startNumber = -2;
int endNumber = 3;
int[] expectedResult = {-2, -1, 0, 1, 2, 3};
AscendingSequence ascendingSequence = new AscendingSequence();
int[] actualResult = ascendingSequence.buildAscendingArray(startNumber, endNumber);
Assert.assertArrayEquals(expectedResult, actualResult);
}
}