computer science

One coding problem I encountered was to do a merge sort of a linked list. I wrote a merge sort in Go, but when I tried to verify it via timing sorting large linked lists, I got some strange behavior

Once upon a time, I wrote four programs that can play a game called squava with lesser or greater amounts of skill.

All four algorithmic players can win against each other, although there are definite differences in apparent skill. I wanted to know what their Elo rating might be.

I falsely believed that I had found a wordle state where an elaborate regular expression with alternations gives fewer possible answers than a simple regexp in a pipeline with extra greps.

I was wrong.

Unix, and now Linux, have included a wc command for a very long time. Most explanations of its use are misleading fluff and garbage, and do not give you an appreciation of its true value.

I thought I would try to do Wordle 1,039 exclusively with computer help.

I did not solve Wordle 1,037. I fell into the too-many-alternatives trap.

I solved Wordle™ brand video game, puzzle number 1,016 without mechanical help. I found it difficult.

I got Wordle 1,001 without mechanized help. I feel like the partial solutions would be worth double-checking with Computer Science.

I solved Wordle™ brand video game, puzzle number 986 without computerized help, but I made a silly 3rd guess. I wondered if the solution word was the only word available after my fourth guess.