Largest difference between adjacent primes

Largest difference between adjacent primes is a draft programming task. It is not yet considered ready to be promoted as a complete task, for reasons that should be found in its talk page.

Task

Find and show on this page the largest difference between adjacent primes, where n<1000

Ring

<lang ring> load "stdlib.ring" see "working..." + nl limit = 1000000 Primes = [] maxOld = 0 maxNew = 0 diffNew = 0 oldDiff = 0

for n = 1 to limit

   maxNew = n
   diffNew = maxNew - maxOld
   if isprime(n) and diffNew > oldDiff
      add(Primes,[n,maxOld])
      oldDiff = diffNew
      maxOld = maxNew
   ok

next

len = len(Primes) diff = Primes[len][1] - Primes[len][2] see Primes[len(Primes)] see nl + "Largest difference is = " + diff + nl see "done..." + nl </lang>

Output:

working...
999269
994657
Largest difference is = 4612
done...