Repository navigation
Expand file tree
/
Copy pathTest.js
More file actions
71 lines (66 loc) · 1.71 KB
/
Copy pathTest.js
File metadata and controls
71 lines (66 loc) · 1.71 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
70
71
var BubbleSort = require('./BubbleSort');
var InsertSort = require('./InsertSort');
var SelectSort = require('./SelectSort');
var HeapSort = require('./HeapSort');
var QuickSort = require('./QuickSort');
var MergeSort = require('./MergeSort');
var BucketSort = require('./BucketSort');
var RadixSort = require('./RadixSort');
function generateRandomAray(maxSize, maxValue) {
var n = parseInt((maxSize+1)*Math.random());
var res = new Array();
for(var i = 0; i < n; i++) {
res[i] = parseInt((maxValue+1)*Math.random());
}
return res;
}
function isEqual(arr1, arr2) {
if((arr1 === null && arr2 !== null) || (arr1 !== null && arr2 === null)) {
return false;
}
if(arr1 === null && arr2 === null) {
return true;
}
if(arr1.length !== arr2.length) {
return false;
}
for(var i = 0; i < arr1.length; i++) {
if(arr1[i] !== arr2[i])
return false;
}
return true;
}
function printArray(nums) {
if(nums === null) return;
var s = "";
for(var i = 0; i < nums.length; i++) {
s += nums[i]+ " ";
}
console.log(s);
}
function comparator(nums) {
nums.sort((a, b) => a - b);
}
// 测试
var testTime = 100;
var maxSize = 100;
var maxValue = 100;
var succeed = true;
for(var i = 0; i < testTime; i++) {
var arr1 = generateRandomAray(maxSize, maxValue);
var arr2 = [...arr1];
// BubbleSort(arr1);
// InsertSort(arr1);
// SelectSort(arr1);
// HeapSort(arr1);
// QuickSort(arr1);
// MergeSort(arr1);
// BucketSort(arr1);
RadixSort(arr1);
comparator(arr2);
if(!isEqual(arr1, arr2)) {
succeed = false;
break;
}
}
console.log(succeed ? "Nice!" : "Fucking fucked!");