Prime triangle: Difference between revisions

Content added Content deleted

Inline

@@ Line 749: / Line 749: @@
 }
-fn prime_triangle(a: &mut [u32]) -> bool {
+fn prime_triangle_row(a: &mut [u32]) -> bool {
     if a.len() == 2 {
         return is_prime(a[0] + a[1]);
@@ Line 756: / Line 756: @@
         if is_prime(a[0] + a[i]) {
             a.swap(i, 1);
-            if prime_triangle(&mut a[1..]) {
+            if prime_triangle_row(&mut a[1..]) {
                 return true;
             }
@@ Line 797: / Line 797: @@
     for n in 2..21 {
         let mut a: Vec<u32> = (1..=n).collect();
-        if prime_triangle(&mut a) {
+        if prime_triangle_row(&mut a) {
             print(&a);
         }