Big Integers in Turbo Pascal 3.01A (4)
As promised, time for a little bit of benchmarking using a common prime number algorithm. To build a little suspense, I compiled and ran my code under Free Pascal 3.04
Continue readingbecause 8 bits are plenty
As promised, time for a little bit of benchmarking using a common prime number algorithm. To build a little suspense, I compiled and ran my code under Free Pascal 3.04
Continue readingDivision The easy way to implement integer division is to use repeated subtraction. I tried this – but even on a Raspberry Pi B under Free Pascal it’s (unsurprisingly) incredibly
Continue readingAddition This follows a similar process to the multiplication algorithm provided that the operands are either both positive or negative. If they’re both negative numbers then the sign of the
Continue readingOne of the unexpected delights of upgrading my RC2014 with the CP/M expansion has been discovering Turbo Pascal. Unexpected, because the last time I used Pascal for anything was sometime
Continue readingContinuing with my foray into Turbo Pascal 3.01A on the RC2014, here’s a reasonable implementation of John Conway’s ‘Life’ algorithm. When I was a Computer Science undergraduate in the early
Continue readingI recently aquired a copy of Celestial BASIC by Eric Burgess. Published in 1982, it promises to offer ‘Astronomy on your computer’. It contains 23 BASIC program listings originaly written
Continue readingWinter can be a dismal time in the UK. At least we’re now a few days past the winter solstice, so the mornings and evenings are starting to get brighter.
Continue readingThe days between Christmas and the new year are always quiet. The weather has been miserable and I’m not feeling particularly inspired to carry on with a brick breaker game
Continue readingI’ve now re-written my prime number generator so that it can scan all integers up to 2.7million-ish while staying within the MZ-80K constraint of a maximum array size of 255.
Continue reading