Just FYI. Learning about routers, I ran across Dijkstra’s famous algorithm, and in researching it I found that the guy was a real COBOL hater. His words, circa 1975, were something like, “The use of COBOL cripples the mind; its teaching should, therefore, be regarded as a criminal offence.” So naturally I had to write a program which would execute his algorithm in COBOL!!
I drew on paper an ad hoc network of about 25 interconnected nodes, with a couple stubs, and transcribed the connections and associated costs into working storage.
Took me two solid tries and some debugging, and sure it could be optimized, but was a fun and educational effort. The trickiest part was keeping track of the various subscripts of several tables. The way I did it, one table had two different subscripts in action at the same time. Expression of satisfaction.
I'm thinking of doing a spanning tree protocol example in COBOL next.