Article archive

A linked list is a linear chain of nodes, each holding data and a pointer to the next node. Here is what that chain costs next to an array, plus a minimal implementation you can run.

An algorithm is an ordered list of steps, and that order decides how expensive a problem is. The examples are on the back of an instant noodle packet, in a factorial, and behind ctrl+z.

The panel says the usage limit is reached and the work stops, not because it is finished. Three guesses explain it, and all three are wrong: the limit is shaped like a cliff, and the day is built on top of one tool.

Two accounts, and each history lists the other account's deposits. The list sat in the class body, append never writes to the object, so both accounts appended into the same one.

Three scores, one division, and the average prints as 82. Both operands are int, so the fraction is cut off, and the obvious cast prints 82.0 without fixing anything.

You pull one function out into its own file, import it, and the whole report runs again and eats your input. A module is a file, import runs it top to bottom, and one line decides which of the two jobs it is doing.