It turns out that it is pretty easy to find a static, two-dimensional encoding for the sorting process. The specific technique used here only works when the sorting algorithm is in-place, i.e. does not use any storage external to the array itself. Some of the algorithms below have been slightly modified from their standard forms to make sure they have this property. The magnitude of a number is indicated by shading - higher numbers are darker, and lower numbers are lighter. We begin on the left hand side with the numbers in a random order, and the sorting progression plays out until we reach the right hand side with a sorted sequence. Time, in this particular case, is measured by the number of “swaps” performed. This means that all swaps are equidistant on the diagram, and that only a single swap occurs at any point in time. (via cortesi - Visualising Sorting Algorithms)
(via Peekaboo: Machine Learning Cheat Sheet (for scikit-learn))
How I Stopped Eating Food : Mostly Harmless -
In my own life I resented the time, money, and effort the purchase, preparation, consumption, and clean-up of food was consuming.
[video]
Batgirl/Robin: Year One TPB Cover // Marcos Martin & Javier Pulido
(via dcu)