by Michael S. Kaplan, published on 2008/02/07 04:01 -05:00, original URI: http://blogs.msdn.com/b/michkap/archive/2008/02/07/7505963.aspx
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)
John Cowan on 7 Feb 2008 8:42 AM:
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.
Michiel on 8 Feb 2008 5:11 AM:
Nope, O(N) - the size of the collection to sort is the same magnitude as the size of the domain.