forked from rampatra/Algorithms-and-Data-Structures-in-Java
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathThoaiSelectionSortTest.java
52 lines (47 loc) · 1.55 KB
/
ThoaiSelectionSortTest.java
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
/*
* Copyright (C) 2022 Thoai
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
import com.rampatra.sorting.SelectionSort;
import org.junit.jupiter.api.Test;
import static org.junit.jupiter.api.Assertions.*;
/**
*
* @author Thoai
*/
public class ThoaiSelectionSortTest {
SelectionSort selectionSort = new SelectionSort();
@Test
public void tesInsertIntoSorted() {
int[] inputArr = new int[] {1,3,5};
int[] inputResult = new int[] {1,3,5};
selectionSort.selectionSort(inputArr);
assertArrayEquals(inputResult, inputArr);
}
@Test
public void tesInsertIntoSorted2() {
int[] inputArr = new int[] {5,3,1};
int[] inputResult = new int[] {1,3,5};
selectionSort.selectionSort(inputArr);
assertArrayEquals(inputResult, inputArr);
}
@Test
public void tesInsertIntoSorted3() {
int[] inputArr = new int[] {4,5,3,2};
int[] inputResult = new int[] {2,3,4,5};
selectionSort.selectionSort(inputArr);
assertArrayEquals(inputResult, inputArr);
}
}