So I put this together. It’s a comparison of various Big-O running times. It was an exercise in a book I’m reading: Introduction to Algorithms, 3rd Edition, which is obsolete now as the 4ed is out.
Comparison of algorithm running times
Reply
So I put this together. It’s a comparison of various Big-O running times. It was an exercise in a book I’m reading: Introduction to Algorithms, 3rd Edition, which is obsolete now as the 4ed is out.
Some diagram generators to check out:
Reading about Window Functions.
An awesome video about The RS-232 protocol by Ben Eater. There’s some cool stuff on his channel.
Today I learned about Booth’s multiplication algorithm. I will have to circle back and read closely.
So I’m off to read the LibreOffice 7.3 API Documentation. Supported macro languages include a form of BASIC and a form of JavaScript. Gonna try JavaScript… my goal is to generate the ASCII tables for my book, programmatically, as it were.
道.
A little nostalgia: The UNIX Time-Sharing System.
There’s a great article over on Wikipedia about the History of programming languages.