Somehow an online conversation got to the discussion of the Towers of Hanoi puzzle. Tower, towers. We discussed other annoying introductory computer science puzzles. The one that always had me baffled was Nim, well, until I learned mathematical induction, anyway.

And any rite of passage from the bad old days included the film Sorting out Sorting. I had the dubious privilege of watching this twice. I remember being baffled by heap sort, but it seems simple now.

It's about the closest thing computer science has to Reefer Madness.