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; |
148 |
|
* and finding index of right closest to split point. |
149 |
|
* Uses left-spine decomposition to generate all |
150 |
|
* merge tasks before bottomming out at base case. |
151 |
– |
* |
151 |
|
*/ |
152 |
|
public final void compute() { |
153 |
|
Merger rights = null; |
208 |
|
|
209 |
|
} |
210 |
|
|
211 |
< |
static void checkSorted (long[] a) { |
211 |
> |
static void checkSorted(long[] a) { |
212 |
|
int n = a.length; |
213 |
|
for (int i = 0; i < n - 1; i++) { |
214 |
|
if (a[i] > a[i+1]) { |