My recursive mergesort algorithm, and the wikipedia bottom-up) algorithm read and write the same list nodes in the same order, for list lengths that are powers of two. Something other than mere data reading and pointer writing causes abrupt performance drops at linked list lengths of 2^N+1 nodes.

I decided to count the number of comparisons used in merging lists. I had to write a different program so as to use an unsorted list with data in the same randomly chosen order for each of the three algorithms.

I tried several minor variations of recursive mergesort to try to understand the abrupt performance drops that my iterative mergesort code exhibits at some linked list lengths.

There’s a last time for everything. My last Wordle was number 1234.

I decided I can no longer give anything, not views, not ad views, not clicks, to the pro-Trump New York Times. I am rage quitting Wordle.

Here’s my Wordle wrap up stats.

I wrote variants of recursive mergesort that simulate function call recurision by iteration with an explicit stack of activation records. This is an effort to try to understand the abrupt performance drops that the wikipedia bottom up algorithm exhibits at some linked list lengths.

Incidentally, these two algorithms both satisfy the Daily Coding Problem problem statement. Their simulated call stack could potentially overflow for extremely long lists, but those stacks wouldn’t have to be much bigger to accomodate those long lists.

When I last had problems with PPP, I noticed that some non-routeable IP addresses ended up getting sent out for DNS reverse lookup.

This is different than routing packets with those same (nominally) non-routeable addresses out into The Internet.

I finally looked at the addresses of linked list nodes that my recursive and wikipedia bottom-up) algorithms read and write.

We use incredibly weak language around smartphones and point-n-click computer interfaces. It’s embarrassing.

There’s a system admin saying: It’s always DNS

But weird problems aren’t always DNS problems. Better than 50% of the time, they’re cabling problems.

I went to see the Union Pacific No. 4014, a Big Boy locomotive, at a whistle stop in Greeley, CO, October 23, 2024.