-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathComparator_05.java
59 lines (53 loc) · 1.72 KB
/
Comparator_05.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
53
54
55
56
57
58
59
// 对数器
public class Comparator_05 {
// 返回1~v范围内的随机数组,长度为n
public static int[] randomArray(int n, int v) {
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = (int)(Math.random() * v) + 1;
}
return arr;
}
// 拷贝一份数组,用于验证
public static int[] copyArray(int[] arr) {
int n = arr.length;
int[] ans = new int[n];
for (int i = 0; i < n; i++) {
ans[i] = arr[i];
}
return ans;
}
public static boolean sameArray(int[] arr1, int[] arr2) {
int n = arr1.length;
for (int i = 0; i < n; i++) {
if (arr1[i] != arr2[i]) {
return false;
}
}
return true;
}
public static void main(String[] args) {
// 随机数组最大长度
int N = 100;
// 随机数组每个值的范围
int V = 1000;
// 测试次数
int testTimes = 50000;
System.out.println("start testing");
for (int i = 0; i < testTimes; i++) {
// 随机得到一个长度
int n = (int)(Math.random() * N);
int[] arr = randomArray(n, V);
int[] arr1 = copyArray(arr);
int[] arr2 = copyArray(arr);
int[] arr3 = copyArray(arr);
Selection_Bubble_InsertionSort_04.selectionSort(arr1);
Selection_Bubble_InsertionSort_04.BubbleSort(arr2);
Selection_Bubble_InsertionSort_04.InsertionSort(arr3);
if (!sameArray(arr1, arr2) || !sameArray(arr1, arr3)) {
System.out.println("error");
}
}
System.out.println("finish testing");
}
}