Re: Aspiring highest-order programmer
From: Programmer Dude (Chris_at_Sonnack.com)
Date: 06/16/04
- Next message: Programmer Dude: "Re: Aspiring highest-order programmer"
- Previous message: Programmer Dude: "Re: Tutorial and guidelines: Basic frame layout"
- In reply to: Edward G. Nilges: "Re: Aspiring highest-order programmer"
- Next in thread: Edward G. Nilges: "Re: Aspiring highest-order programmer"
- Reply: Edward G. Nilges: "Re: Aspiring highest-order programmer"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Wed, 16 Jun 2004 08:50:27 -0500
Edward G. Nilges writes:
> n log n is sweet. Again, graph it. The rate of acceleration slows
> down.
Are you sure you're not thinking of plain O(log N)?
O(N log N) is fairly linear...
http://www.Sonnack.com/WillCall/O_N2.png
http://www.Sonnack.com/WillCall/O_NlogN.png
http://www.Sonnack.com/WillCall/O_logN.png
-- |_ CJSonnack <Chris@Sonnack.com> _____________| How's my programming? | |_ http://www.Sonnack.com/ ___________________| Call: 1-800-DEV-NULL | |_____________________________________________|_______________________|
- Next message: Programmer Dude: "Re: Aspiring highest-order programmer"
- Previous message: Programmer Dude: "Re: Tutorial and guidelines: Basic frame layout"
- In reply to: Edward G. Nilges: "Re: Aspiring highest-order programmer"
- Next in thread: Edward G. Nilges: "Re: Aspiring highest-order programmer"
- Reply: Edward G. Nilges: "Re: Aspiring highest-order programmer"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|