The insertion sort is the kind of simple algorithm humans tend to do when ordering a deck of cards. Sometimes, it’s also a Hungarian folk dance, useful for putting a line of dancers in order. Just remember: if you’re trying to order large sets of things, you probably want to use the old quicksort, heapsort, or merge sort. (AlgoRythmics via Flowing Data)