From: John Max Skaller (skaller_at_[hidden])
Date: 2001-08-21 18:28:13
Peter Dimov wrote:
> > is an O(n) + O(n^3) operation. The O(n) is irrelevant for large n.
> > But not in the common case n=2, where it represents 20% of overall time.
> > For addition, its 50%.
> Big-O tells you nothing for small n. And sometimes for relatively large n.
yes, I know, sorry for abusing the notation.
> memset() is incredibly fast nowadays. :-)
Sure, but as long as the limit is bus/memory cycle times,
its still an order of magnitude slower than the CPU.
-- John (Max) Skaller, mailto:skaller_at_[hidden] 10/1 Toxteth Rd Glebe NSW 2037 Australia voice: 61-2-9660-0850 New generation programming language Felix http://felix.sourceforge.net Literate Programming tool Interscript http://Interscript.sourceforge.net
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk