11 |
|
|
12 |
|
// Performance-tuning constant: |
13 |
|
static long lastStealCount; |
14 |
< |
|
14 |
> |
|
15 |
|
public static void main(String[] args) throws Exception { |
16 |
|
int procs = 0; |
17 |
|
int num = 43; |
26 |
|
return; |
27 |
|
} |
28 |
|
|
29 |
< |
|
29 |
> |
|
30 |
|
for (int reps = 0; reps < 2; ++reps) { |
31 |
|
ForkJoinPool g = procs == 0? new ForkJoinPool() : |
32 |
|
new ForkJoinPool(procs); |
62 |
|
int number; |
63 |
|
DynamicLeftSpineFib next; |
64 |
|
|
65 |
< |
DynamicLeftSpineFib(int n, DynamicLeftSpineFib nxt) { |
66 |
< |
number = n; next = nxt; |
65 |
> |
DynamicLeftSpineFib(int n, DynamicLeftSpineFib nxt) { |
66 |
> |
number = n; next = nxt; |
67 |
|
} |
68 |
|
|
69 |
|
int getAnswer() { |
100 |
|
|
101 |
|
// Sequential version for arguments less than threshold |
102 |
|
static int seqFib(int n) { |
103 |
< |
if (n <= 1) |
103 |
> |
if (n <= 1) |
104 |
|
return n; |
105 |
< |
else |
105 |
> |
else |
106 |
|
return seqFib(n-1) + seqFib(n-2); |
107 |
|
} |
108 |
< |
|
108 |
> |
|
109 |
|
} |
110 |
|
|