Prime triangle: Difference between revisions
m
Minor optimization to Java code - see discussion page
m (Minor optimization to C code - see discussion page) |
m (Minor optimization to Java code - see discussion page) |
||
Line 613:
if (length == 2)
return isPrime(a[start] + a[start + 1]);
for (int i = 1; i + 1 < length; i +
if (isPrime(a[start] + a[start + i])) {
swap(a, start + i, start + 1);
Line 630:
++count;
} else {
for (int i = 1; i + 1 < length; i +
if (isPrime(a[start] + a[start + i])) {
swap(a, start + i, start + 1);
Line 676:
1 1 1 1 1 2 4 7 24 80 216 648 1304 3392 13808 59448 155464 480728 1588162
Elapsed time:
</pre>
| |||