On 30/05/2025 10:03, Mikko wrote:
On 2025-05-29 16:42:09 +0000, olcott said:
<snip>
We must achieve 100% complete closure on each point one-at-a-time and
not endlessly flit back and forth across many different points never
achieving closure on any of them.
You are not and never have been asked to endlessly flit back and forth.
But you are doing it anyway. You have been adviced how to to something
more useful but you have never done.
Quite so. At some point, one must draw a veil across the nonsense. I
think I've reached that point. I do not plan to reply to any more of Mr Olcott's articles. (Road to hell and that, but that's the plan.)
In the case I gave it, O(n) becomes O(1). It was
a "trick" I figured out on the Commodore PET in
the 80's: using the numeric keypad as an index
for arrays to add x/y values to compute a player's
movement in a rudimentary game I wrote. (In BASIC,
I'm ashamed to say. ;) The array computation replaced
a bunch of if-then statements, and it ran a lot faster
after that.
Sysop: | Keyop |
---|---|
Location: | Huddersfield, West Yorkshire, UK |
Users: | 546 |
Nodes: | 16 (2 / 14) |
Uptime: | 02:05:01 |
Calls: | 10,385 |
Calls today: | 2 |
Files: | 14,057 |
Messages: | 6,416,581 |