Prime triangle: Difference between revisions

Content added Content deleted

Inline

@@ Line 162: / Line 162: @@
 }
-bool prime_triangle(unsigned int* a, size_t length) {
+bool prime_triangle_row(unsigned int* a, size_t length) {
     if (length == 2)
         return is_prime(a[0] + a[1]);
@@ Line 168: / Line 168: @@
         if (is_prime(a[0] + a[i])) {
             swap(a, i, 1);
-            if (prime_triangle(a + 1, length - 1))
+            if (prime_triangle_row(a + 1, length - 1))
                 return true;
             swap(a, i, 1);
@@ Line 206: / Line 206: @@
         for (unsigned int i = 0; i < n; ++i)
             a[i] = i + 1;
-        if (prime_triangle(a, n))
+        if (prime_triangle_row(a, n))
             print(a, n);
     }