A sort of vagabonds, rascals, and runaways

June 2, 2005 8:34 AM

Shakespearean combsort. (PS)
posted by Wolfdog (8 comments total)

Uh, cool. For some definition of cool. Kinda strange that they just showed the running time of combsort vs. quicksort on n=10000. Maybe they didn't feel like doing a real complexity analysis. Oddly, neither do I.

The presentation of a sorting algorithm as a Shakespearean play is excellent. I'm going to start writing all my code in sonnet form.
posted by gurple at 8:48 AM on June 2, 2005

Oh, my god.
posted by gurple at 8:50 AM on June 2, 2005

gurple: "The presentation of a sorting algorithm as a Shakespearean play is excellent. I'm going to start writing all my code in sonnet form."

See also the Perl module Lingua::Romana::Perligata, which yeilds code like:

    #! /usr/local/bin/perl -w
    use Lingua::Romana::Perligata;

    maximum inquementum tum biguttam egresso scribe.
    meo maximo vestibulo perlegamentum da.
    da duo tum maximum conscribementa meis listis.

    dum listis decapitamentum damentum nexto
      fac sic
        nextum tum novumversum scribe egresso.
        lista sic hoc recidementum nextum cis vannementa da listis.
      cis.
posted by Plutor at 9:54 AM on June 2, 2005

gurple i was thinking the same thing... it's weird that they only show running time where n=10,000; it's a meaningless benchmark. i doubt combsort is O(n log n).

shakespearean language thing is cool... there was a slashdot thread on that a while back. it's not as good as OOK though.
posted by jcruelty at 10:59 AM on June 2, 2005

it's not as good as OOK though.

I am aghast. Wow. Elegant in its simplicity.
posted by gurple at 11:08 AM on June 2, 2005

Good lord! I am... amazed.
posted by Specklet at 2:42 PM on June 2, 2005

Personally, I still do all my programing in Unlambda.
posted by Joey Michaels at 2:53 PM on June 2, 2005

Hee!
posted by dejah420 at 7:25 PM on June 2, 2005