Services & Resources / Wolfram Forums / MathGroup Archive
-----

MathGroup Archive 2008

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Re: List concatenation - two more methods, one truly fast

  • To: mathgroup at smc.vnet.net
  • Subject: [mg87841] Re: [mg87805] Re: List concatenation - two more methods, one truly fast
  • From: "W_Craig Carter" <ccarter at mit.edu>
  • Date: Fri, 18 Apr 2008 02:41:50 -0400 (EDT)
  • References: <ftv8ro$7o1$1@smc.vnet.net> <200804171058.GAA15285@smc.vnet.net>

>  It would be nice if someone from Wolfram could comment on these timing
>  results.
>

I agree, but I fear that our wish lists will exceed the personnel
resources at Wolfram.

In the meantime, it would be nice to form a wiki with a "timing stub"
with plots like:

p1 = ListLinePlot[
 Table[{2^n,
   Timing[poly = {}; Do[AppendTo[poly, p[i]], {i, 1, 2^n}]][[1]]}, {n,
    1, 12}]]

and

p2 = ListLinePlot[
  Table[{2^n,
    Timing[poly = {};
      Timing[Do[poly[[i]] = p[i], {i, 1, 2^n}]][[1]]][[1]]}, {n, 1,
    12}]]

Show[p1, p2]

Any volunteers?
-- 
W. Craig Carter


  • Prev by Date: Quantile and InverseCDF
  • Next by Date: SparseArray memory usage
  • Previous by thread: Re: List concatenation - two more methods, one truly fast
  • Next by thread: Re: List concatenation - two more methods, one truly fast