Sorting it all Out Michael Kaplan's random stuff of dubious value Be sure to read the disclaimer here first!
It has been a while since I had a Broom-Hilda strip that had me laughing like this one:
I suppose I could ask people what they thought the optimal sorting algorithm might be.
Could it be any worse than Obama's foray in this space? :-)
(Hat tip to Tina)
This post brought to you by L (U+004c, aka LATIN CAPITAL LETTER L)
Straight selection sort, no question. It's O(N^2), but N is small, and anyway we all have the alphabet song in our heads.
Nope, O(N) - the size of the collection to sort is the same magnitude as the size of the domain.