forked from hustcc/JS-Sorting-Algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathHusonSortTest.java
More file actions
69 lines (60 loc) · 1.93 KB
/
HusonSortTest.java
File metadata and controls
69 lines (60 loc) · 1.93 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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
import huson.BubbleSort;
import huson.InsertionSort;
import huson.SelectionSort;
import org.junit.After;
import org.junit.Assert;
import org.junit.Before;
import org.junit.Test;
import java.util.Arrays;
import java.util.Random;
public class HusonSortTest
{
private int[] array = null;
private int[] sortedArray = null;
private int number = 200;
private int min = 100;
private int max = 1000;
@Before
public void setArray()
{
array = generateRandomArray(number, min, max);
sortedArray = Arrays.copyOf(array, array.length);
Arrays.sort(sortedArray);
}
@After
public void clearArray()
{
array = null;
sortedArray = null;
}
@Test
public void testBubbleSort()
{
System.out.println("sortedArray = \n" + Arrays.toString(sortedArray));
System.out.println("bubbleSortedArray = \n" + Arrays.toString(new BubbleSort().sort(array)));
Assert.assertArrayEquals(sortedArray, new BubbleSort().sort(array));
}
@Test
public void testSelectionSort()
{
System.out.println("sortedArray = \n" + Arrays.toString(sortedArray));
System.out.println("selectionSortedArray = \n" + Arrays.toString(new SelectionSort().sort(array)));
Assert.assertArrayEquals(sortedArray, new SelectionSort().sort(array));
}
@Test
public void testInsertionSort()
{
System.out.println("sortedArray = \n" + Arrays.toString(sortedArray));
System.out.println("selectionSortedArray = \n" + Arrays.toString(new InsertionSort().sort(array)));
Assert.assertArrayEquals(sortedArray, new InsertionSort().sort(array));
}
private int[] generateRandomArray(int number, int min, int max)
{
int[] result = new int[number];
for (int i = 0; i < number; i++) {
Random random = new Random();
result[i] = random.nextInt(max - min) + min;
}
return result;
}
}