Tag Archives: ALGOL 68

Yet more Roman Number Conversions

Yes – I know this is another obscure ALGOL68 post, but I just can’t help liking this archaic language for all it’s strangeness, and it can get pretty strange!

Posted in Programming | Tagged | 2 Comments

More Roman Number Conversions

Last time I looked at updating my original post I got a little side tracked and ended up rewriting the original code rather than adding a routine to convert an integer to roman numerals.

Posted in Programming | Tagged | 1 Comment

Roman Number Conversion

This is an update of an older post describing a short program written in ALGOL 68 to convert strings of roman numbers to decimal integer values.

Posted in Programming | Tagged | Leave a comment

Binary Tree

Another code example that I’ve dug out of my archives is one that shows how to create a binary tree structure and print out the results using in ALGOL 68.

Posted in Programming | Tagged | Leave a comment

Linked List

Various recursive routines to manipulate linked lists written (a long time ago) using ALGOL 68, classic stuff!

Posted in Programming | Tagged | 1 Comment

Towers of Hanoi

A classic example of a recursive algorithm implemented using ALGOL 68 to solve the Towers of Hanoi problem for one, two, three, four and five discs.

Posted in Programming | Tagged | Leave a comment

Gregory’s series

Another short ALGOL 68 program that I wrote last year while trying to get to grips with the language again, and as before this was based on a existing PASCAL program that I’d written previously.

Posted in Programming | Tagged | Leave a comment

Taylor’s Expansion

I was just messing about earlier and having found a short PASCAL program to find e using Taylor’s expansion series, I wondered how long it would take me to rewrite it in ALGOL 68.

Posted in Programming | Tagged | Leave a comment