TIL! That’s great. I really wouldn’t like to upgrade unless I have to.

Correction to the last step: I meant to say ”turn on secure boot to support UEFI”.

Some PCs like mine require manual steps to qualify for the Windows 11 upgrade:

- convert MBR to GPT
- disable CSM (compatibility support module)
- turn on UEFI

Technical, yes. Difficult, no. I would gladly help a relative or a neighbor if they asked with this.

yourmagicisworking.itch.io/liikennematto

I’ll add that O(nm) is used for 2D array based functions (e.g. inner loop).

Maybe this is something that warrants a mention, like a footnote (to avoid complicating the meat of the article)?

Right. I’ve seen examples with multiple components, signalling that an algorithm has multiple expensive operations to it (for example, in a gamedev book). In a case of two linear components, there is no clear winner, I guess?

Great post, as expected! 💯

I wonder about the buildList example, though. The time complexity analysis of the function seems to omit the .join() operation, which makes the big O value either O(n^2+n) or O(2n), right?

This had a good chance to age like milk with yesterday’s GPT-5 release, alas, it did not. Incremental improvements.

That’s a lot of modern SW dev jargon in a single skeet! Explain this to a programmer from the previous century…