Prime numbers whose neighboring pairs are tetraprimes: Difference between revisions

Content added Content deleted
(Added XPL0 example.)
(→‎{{header|Wren}}: More efficient as we need to sort the gaps anyway to find the median.)
Line 90: Line 90:
var gaps = List.filled(tetras.count-1, 0)
var gaps = List.filled(tetras.count-1, 0)
for (k in 0...tetras.count-1) gaps[k] = tetras[k+1] - tetras[k]
for (k in 0...tetras.count-1) gaps[k] = tetras[k+1] - tetras[k]
var min = Nums.min(gaps)
gaps.sort()
var max = Nums.max(gaps)
var min = gaps[0]
var med = Nums.median(gaps.sort())
var max = gaps[-1]
var med = Nums.median(gaps)
Fmt.print("Minimum gap between those $,d primes : $,d", c, min)
Fmt.print("Minimum gap between those $,d primes : $,d", c, min)
Fmt.print("Average gap between those $,d primes : $,d", c, avg)
Fmt.print("Median gap between those $,d primes : $,d", c, avg)
Fmt.print("Maximum gap between those $,d primes : $,d", c, max)
Fmt.print("Maximum gap between those $,d primes : $,d", c, max)
Fmt.print()
Fmt.print()
Retrieved from "https://rosettacode.org/wiki/Prime_numbers_whose_neighboring_pairs_are_tetraprimes"