[ABE.pm] Great pun

[Walt Mankowski]

I love xkcd, but sadly there's a glaring error in the last panel of
yesterday's strip.  It really doesn't make sense to talk about the
lower bound of anything being O(n log n).  Big-O notation refers to
*upper* bounds, not lower bounds.  I know that lots of CS people tend
to toss around big-O to mean all sorts of stuff, but that doesn't
strike me as a mistake that Knuth would make.

Walt

On Wed, Nov 14, 2007 at 10:43:08AM -0500, Faber J. Fedor wrote:
> 
> Yes, it's Perl related.
> 
> Start here: http://www.xkcd.com/341/ and read all three pages (well,
> there are three as of 20071114).
> 
> 
> -- 
>  
> Regards,
>  
> Faber Fedor
> President
> Linux New Jersey, Inc.
> 908-320-0357
> 800-706-0701
> 
> http://www.linuxnj.com
> 
> 
> 
> 
> -- 
> This message has been scanned for viruses and
> dangerous content by MailScanner, and is
> believed to be clean.
> 
> _______________________________________________
> ABE-pm mailing list
> ABE-pm at pm.org
> http://mail.pm.org/mailman/listinfo/abe-pm