Close-by primes - a benchmark (collection)

discussion of beeb/electron applications, languages, utils and educational s/w
Post Reply
User avatar
Posts: 2331
Joined: Sun Jan 24, 2010 10:24 am
Location: West

Close-by primes - a benchmark (collection)

Post by BigEd » Sat Jul 07, 2018 8:17 am

If you like benchmarks, and prime numbers, you might like this thread over on
slightly OT: a simple Benchmark

As the thread progresses, you'll notice it encompasses the comparisons of back-in-the-day machines, but also their respective Basics, and also various faster ways to compute the same results. Which does make the whole thing a bit of a moving target, but it's interesting all the same.

A recent BBC Basic program is especially interesting, I think, with some unusual use of FOR..NEXT in a recursive function as a way of creating something a little like a block-structured IF..THEN.

(It would be most excellent if someone could cook up a JSBeeb URL for this ditty! Even better if they could post the recipe for turning listings into URLs. I've done it myself in the past but I'm not sure those neurons are still alive.)

Other findings in there
- mentions of PLASMA and VTL02 languages
- a short Basic program using square instead of square root
- a 65C02 version and a 6502 version in a65 format
- assembly language versions for the historical 68000 and the recent 65020
- some photos of Jaguar, a homebrew 16MHz 65C02 single board computer (not yet benchmarked)

Post Reply