Data update

Task/Ascending-primes/ALGOL-68/ascending-primes.alg

@@ -1,6 +1,6 @@
 BEGIN # find all primes with strictly increasing digits                      #
     PR read "primes.incl.a68" PR                   # include prime utilities #
-    PR read "rows.incl.a68"   PR                   # include array utilities #
+    PR read "sort.incl.a68"   PR                   # include  sort utilities #
     [ 1 : 512 ]INT primes;         # there will be at most 512 (2^9) primes  #
     INT p count := 0;                        # number of primes found so far #
     FOR d1 FROM 0 TO 1 DO
@@ -36,7 +36,7 @@ BEGIN # find all primes with strictly increasing digits                      #
             OD
         OD
     OD;
-    QUICKSORT primes FROMELEMENT 1 TOELEMENT p count;     # sort the primes #
+    primes QUICKSORT ELEMENTS( 1, p count );              # sort the primes #
     FOR i TO p count DO                                # display the primes #
         print( ( "  ", whole( primes[ i ], -8 ) ) );
         IF i MOD 10 = 0 THEN print( ( newline ) ) FI

Task/Ascending-primes/NewLISP/ascending-primes.l

@@ -0,0 +1,17 @@
+(define (prime? n) (= 1 (length (factor (int n)))))
+
+(define (powerset lst)
+  (if lst
+    (let (p (powerset (1 lst)))
+      (append p (map (curry cons (lst 0)) p)))
+    '(())))
+
+(letn (primes
+        (sort (filter prime?
+          (map (fn (xs) (int (apply string (sort xs)) 0))
+            (powerset (sequence 1 9)))))
+       cnt)
+  (dolist (n primes)
+    (print (format "%9d" n))
+    (if (zero? (% (++ cnt) 6)) (println)))
+  (println "\n\nNumber found: " (length primes)))

Task/Ascending-primes/PascalABC.NET/ascending-primes.pas

@@ -0,0 +1,10 @@
+##
+uses School;
+
+function AscendingSeq(n: integer): sequence of integer;
+begin
+  for var x := n*10 + n mod 10 + 1 to n*10 + 9 do
+    yield sequence AscendingSeq(x) + x;
+end;
+
+AscendingSeq(0).Order.Where(n -> n.IsPrime).Print;