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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
|
package de.lmu.ifi.dbs.elki.utilities.datastructures.arrays;
/*
This file is part of ELKI:
Environment for Developing KDD-Applications Supported by Index-Structures
Copyright (C) 2015
Ludwig-Maximilians-Universität München
Lehr- und Forschungseinheit für Datenbanksysteme
ELKI Development Team
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero 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 Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
import static org.junit.Assert.assertTrue;
import java.util.Random;
import org.junit.Test;
import de.lmu.ifi.dbs.elki.JUnit4Test;
/**
* Test the integer array (index array) quick sort.
*
* @author Erich Schubert
*/
public class TestDoubleIntegerArrayQuickSort implements JUnit4Test {
/**
* Array size to use.
*/
final int SIZE = 10000;
@Test
public void testRandomDoubles() {
for(int i = 1; i < 10; i++) {
testQuickSort(i);
testQuickSortReverse(i);
}
testQuickSort(SIZE);
testQuickSortReverse(SIZE);
testQuickSort(SIZE + 1);
}
private void testQuickSort(int size) {
final double[] data = new double[size];
int[] idx = new int[size];
// Make a random generator, but remember the seed for debugging.
Random r = new Random();
long seed = r.nextLong();
r = new Random(seed);
// Produce data
for(int i = 0; i < size; i++) {
data[i] = r.nextDouble();
idx[i] = i;
}
// Run QuickSort and validate monotonicity.
DoubleIntegerArrayQuickSort.sort(data, idx, size);
double prev = data[0];
for(int i = 1; i < size; i++) {
double val = data[i];
assertTrue("Resulting array is not sorted. Seed=" + seed, prev <= val);
prev = val;
}
}
private void testQuickSortReverse(int size) {
final double[] data = new double[size];
int[] idx = new int[size];
// Make a random generator, but remember the seed for debugging.
Random r = new Random();
long seed = r.nextLong();
r = new Random(seed);
// Produce data
for(int i = 0; i < size; i++) {
data[i] = r.nextDouble();
idx[i] = i;
}
// Run QuickSort and validate monotonicity.
DoubleIntegerArrayQuickSort.sortReverse(data, idx, size);
double prev = data[0];
for(int i = 1; i < size; i++) {
double val = data[i];
assertTrue("Resulting array is not sorted. Seed=" + seed, prev >= val);
prev = val;
}
}
@Test(timeout = 500)
public void testTies() {
int size = 1000000;
int[] idx = new int[size];
double[] data = new double[size];
// Run QuickSort and validate monotonicity.
DoubleIntegerArrayQuickSort.sort(data, idx, size);
}
@Test(timeout = 500)
public void testSorted() {
int size = 1000000;
int[] idx = new int[size];
double[] data = new double[size];
// Initialize indexes
for(int i = 0; i < size; i++) {
idx[i] = size - i;
data[i] = i;
}
// Run QuickSort and validate monotonicity.
DoubleIntegerArrayQuickSort.sort(data, idx, size);
double prev = data[0];
for(int i = 1; i < size; i++) {
double val = data[i];
assertTrue("Resulting array is not sorted.", prev <= val);
prev = val;
}
}
}
|