forked from TheAlgorithms/Java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathInsertionSortTest.java
More file actions
34 lines (25 loc) · 1.25 KB
/
InsertionSortTest.java
File metadata and controls
34 lines (25 loc) · 1.25 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
package src.test.java.com.sorts;
import org.junit.Assert;
import org.junit.Test;
import src.main.java.com.sorts.InsertionSort;
public class InsertionSortTest {
@Test
public void insertionSortTest() {
InsertionSort insertionSort = new InsertionSort();
Integer[] unsortedInt = new Integer[]{0, 5, 9, 2, 1, 3, 4, 8, 6, 7};
Integer[] sortedInt = new Integer[]{0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
Assert.assertArrayEquals(sortedInt, insertionSort.sort(unsortedInt));
unsortedInt = new Integer[]{5,4,3,2,1,0};
sortedInt = new Integer[]{0, 1, 2, 3, 4, 5};
Assert.assertArrayEquals(sortedInt, insertionSort.sort(unsortedInt));
unsortedInt = new Integer[]{-1,-2,-3,-4,-5};
sortedInt = new Integer[]{-5,-4,-3,-2,-1};
Assert.assertArrayEquals(sortedInt, insertionSort.sort(unsortedInt));
unsortedInt = new Integer[]{-1,-5,-10,-990,990,1010};
sortedInt = new Integer[]{-990,-10,-5,-1,990,1010};
Assert.assertArrayEquals(sortedInt, insertionSort.sort(unsortedInt));
Character[] unsortedChar = new Character[]{'f', 'h', 'c', 'a', 'b', 'd', 'g', 'e'};
Character[] sortedChar = new Character[]{'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h'};
Assert.assertArrayEquals(sortedChar, insertionSort.sort(unsortedChar));
}
}