Fixes to ch2 (premature optimisation)

8 files changed, 0 insertions, 23 deletions

diff --git a/challenge-147/roger-bell-west/javascript/ch-2.js b/challenge-147/roger-bell-west/javascript/ch-2.js
index 8d55a5edde..2cbfbc98a8 100755
--- a/challenge-147/roger-bell-west/javascript/ch-2.js
+++ b/challenge-147/roger-bell-west/javascript/ch-2.js
@@ -17,9 +17,6 @@ function pentpair() {
         }
         for (b = 1; b < a; b++) {
             let d=fpent[a]-fpent[b];
-            if (d < fpent[b]) {
-                break;
-            }
             if (rpent.has(d)) {
                 let s=fpent[a]+fpent[b];
                 while (s > fpent[mx]) {
diff --git a/challenge-147/roger-bell-west/kotlin/ch-2.kt b/challenge-147/roger-bell-west/kotlin/ch-2.kt
index e42ec3f622..165ab5ce2d 100644
--- a/challenge-147/roger-bell-west/kotlin/ch-2.kt
+++ b/challenge-147/roger-bell-west/kotlin/ch-2.kt
@@ -18,9 +18,6 @@ fun pentpair() {
         }
         for (b in 1..a-1) {
             val d=fpent[a]-fpent[b]
-            if (d < fpent[b]) {
-                break
-            }
             if (rpent.contains(d)) {
                 val s=fpent[a]+fpent[b]
                 while (s > fpent[mx]) {
diff --git a/challenge-147/roger-bell-west/lua/ch-2.lua b/challenge-147/roger-bell-west/lua/ch-2.lua
index c46defd3d4..cbe31d0ed8 100755
--- a/challenge-147/roger-bell-west/lua/ch-2.lua
+++ b/challenge-147/roger-bell-west/lua/ch-2.lua
@@ -17,9 +17,6 @@ function pentpair()
       end
       for b = 1,a do
          d=fpent[a]-fpent[b]
-         if d < fpent[b] then
-            break
-         end
          if rpent[d] ~= nil then
             s=fpent[a]+fpent[b]
             while s > fpent[mx] do
diff --git a/challenge-147/roger-bell-west/perl/ch-2.pl b/challenge-147/roger-bell-west/perl/ch-2.pl
index 5a9c30c441..1648a13d68 100755
--- a/challenge-147/roger-bell-west/perl/ch-2.pl
+++ b/challenge-147/roger-bell-west/perl/ch-2.pl
@@ -18,9 +18,6 @@ sub pentpair {
     }
     foreach my $b (1..$a-1) {
       my $d=$fpent[$a]-$fpent[$b];
-      if ($d < $fpent[$b]) {
-        last;
-      }
       if (exists $rpent{$d}) {
         my $s=$fpent[$a]+$fpent[$b];
         while ($s > $fpent[$mx]) {
diff --git a/challenge-147/roger-bell-west/python/ch-2.py b/challenge-147/roger-bell-west/python/ch-2.py
index 83f5c48bba..b524b7e5e5 100755
--- a/challenge-147/roger-bell-west/python/ch-2.py
+++ b/challenge-147/roger-bell-west/python/ch-2.py
@@ -15,8 +15,6 @@ def pentpair():
       rpent[fpent[mx]]=mx
     for b in range(1,a):
       d=fpent[a]-fpent[b]
-      if d < fpent[b]:
-        break
       if d in rpent:
         s=fpent[a]+fpent[b]
         while s > fpent[mx]:
diff --git a/challenge-147/roger-bell-west/raku/ch-2.p6 b/challenge-147/roger-bell-west/raku/ch-2.p6
index 0f784c1018..d333f3337f 100755
--- a/challenge-147/roger-bell-west/raku/ch-2.p6
+++ b/challenge-147/roger-bell-west/raku/ch-2.p6
@@ -15,9 +15,6 @@ sub pentpair {
         }
         for 1..$a-1 -> $b {
             my $d=@fpent[$a]-@fpent[$b];
-            if ($d < @fpent[$b]) {
-                last;
-            }
             if (%rpent{$d}:exists) {
                 my $s=@fpent[$a]+@fpent[$b];
                 while ($s > @fpent[$mx]) {
diff --git a/challenge-147/roger-bell-west/ruby/ch-2.rb b/challenge-147/roger-bell-west/ruby/ch-2.rb
index 0c79ae306e..3c0de3457a 100755
--- a/challenge-147/roger-bell-west/ruby/ch-2.rb
+++ b/challenge-147/roger-bell-west/ruby/ch-2.rb
@@ -17,9 +17,6 @@ def pentpair()
     end
     1.upto(a-1) do |b|
       d=fpent[a]-fpent[b]
-      if d < fpent[b] then
-        break
-      end
       if rpent.has_key?(d) then
         s=fpent[a]+fpent[b]
         while s > fpent[mx] do
diff --git a/challenge-147/roger-bell-west/rust/ch-2.rs b/challenge-147/roger-bell-west/rust/ch-2.rs
index afce14516a..044722976e 100755
--- a/challenge-147/roger-bell-west/rust/ch-2.rs
+++ b/challenge-147/roger-bell-west/rust/ch-2.rs
@@ -20,9 +20,6 @@ fn pentpair() {
         }
         for b in 1..=a - 1 {
             let d = fpent[a] - fpent[b];
-            if d < fpent[b] {
-                break;
-            }
             if rpent.contains_key(&d) {
                 let s = fpent[a] + fpent[b];
                 while s > fpent[mx] {