The naive collision detection algorithm takes O(n^2) by checking pairwise intersection. To improve the performance, sort the objects by x coordinates, scan from left to right and only check intersection if a.right < b.left. This method can be extended into 2D to further eliminate the necessary comparisons. Finally, note that insertion sort is more performant on mostly sorted lists than quick sorts, so it's more suitable in this case.

Links to tutorials on graphics programming.

Explanation of the working of different parts in a transformer by manually coding the weights.

A comprehensive video tutorial on the Transformer architecture by Andrej Karpathy.

A really interesting thread on relativity. OP analogize the nonlinearity of slopes comparing to angles to describe how speed in relativity is an more cumbersome defined property compared to a more tidy notion of "rapidity" which is linear.

Of all the Nix tutorial I read, Nix Pills makes most sense to me. It doesn't just tell you how to do things, but also let you know why.

An "awesome list" of tutorials on building things from scratch.