Prime triangle: Difference between revisions
Content added Content deleted
(→{{header|Visual Basic .NET}}: Show correct output (including rows 9 & 20)) |
m (Minor optimization to C code - see discussion page) |
||
| Line 164: | Line 164: | ||
if (length == 2) |
if (length == 2) |
||
return is_prime(a[0] + a[1]); |
return is_prime(a[0] + a[1]); |
||
for (size_t i = 1; i + 1 |
for (size_t i = 1; i + 1 < length; i += 2) { |
||
if (is_prime(a[0] + a[i])) { |
if (is_prime(a[0] + a[i])) { |
||
swap(a, i, 1); |
swap(a, i, 1); |
||
| Line 181: | Line 181: | ||
++count; |
++count; |
||
} else { |
} else { |
||
for (size_t i = 1; i + 1 |
for (size_t i = 1; i + 1 < length; i += 2) { |
||
if (is_prime(a[0] + a[i])) { |
if (is_prime(a[0] + a[i])) { |
||
swap(a, i, 1); |
swap(a, i, 1); |
||
| Line 250: | Line 250: | ||
1 1 1 1 1 2 4 7 24 80 216 648 1304 3392 13808 59448 155464 480728 1588162 |
1 1 1 1 1 2 4 7 24 80 216 648 1304 3392 13808 59448 155464 480728 1588162 |
||
Elapsed time: 0. |
Elapsed time: 0.572986 seconds |
||
</pre> |
</pre> |
||