4 |
|
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
|
*/ |
6 |
|
|
7 |
– |
import java.util.concurrent.*; |
7 |
|
import java.util.*; |
8 |
+ |
import java.util.concurrent.*; |
9 |
|
|
10 |
|
class ScalarLongSort { |
11 |
|
static final long NPS = (1000L * 1000 * 1000); |
13 |
|
static int THRESHOLD = -1; |
14 |
|
static final boolean warmup = true; |
15 |
|
|
16 |
< |
public static void main (String[] args) throws Exception { |
16 |
> |
public static void main(String[] args) throws Exception { |
17 |
|
int procs = 0; |
18 |
|
int n = 1 << 22; |
19 |
|
int reps = 20; |
78 |
|
} |
79 |
|
System.out.println(pool); |
80 |
|
|
81 |
– |
|
81 |
|
pool.shutdown(); |
82 |
|
} |
83 |
|
|
147 |
|
* and finding index of right closest to split point. |
148 |
|
* Uses left-spine decomposition to generate all |
149 |
|
* merge tasks before bottomming out at base case. |
151 |
– |
* |
150 |
|
*/ |
151 |
|
public final void compute() { |
152 |
|
Merger rights = null; |
207 |
|
|
208 |
|
} |
209 |
|
|
210 |
< |
static void checkSorted (long[] a) { |
210 |
> |
static void checkSorted(long[] a) { |
211 |
|
int n = a.length; |
212 |
|
for (int i = 0; i < n - 1; i++) { |
213 |
|
if (a[i] > a[i+1]) { |
245 |
|
} |
246 |
|
} |
247 |
|
} |
250 |
– |
|
251 |
– |
|
248 |
|
} |