MathGroup Archive 2013

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

Search the Archive

Re: Timing puzzle

  • To: mathgroup at smc.vnet.net
  • Subject: [mg130460] Re: Timing puzzle
  • From: carlos%colorado.edu at gtempaccount.com
  • Date: Fri, 12 Apr 2013 02:18:45 -0400 (EDT)
  • Delivered-to: l-mathgroup@mail-archive0.wolfram.com
  • Delivered-to: l-mathgroup@wolfram.com
  • Delivered-to: mathgroup-newout@smc.vnet.net
  • Delivered-to: mathgroup-newsend@smc.vnet.net
  • References: <kk2qvl$bip$1@smc.vnet.net>

Clarification: n was 1000 in the posted test; for some reason the top line was mangled in copy/paste.
For n=5000 the results are

5.37185 Second
5.27741 Second
5.41862 Second
3.18303 Second
0.024265 Second

Conclusion: time for the top 4 goes up ~linearly, which suggests that the list is being modified by just appending one item, instead of placing a pointer to it.  For the last one it goes up sublinearly.

Reason for worry: in the actual plot package n is not known until the plot is finished. My  plotter actually builds dynamically three Graphics3D sublists: faces, edges, points and labels. Optional commands such as changing point size, thickness, colors and font styles, may be inserted at any point in those sublists.  So the faster method (preallocating addresses with Table) is ruled out.





  • Prev by Date: Re: Arranging disks (or any object for that matter) be
  • Next by Date: "Overlapped" and "Stacked" layout in Histogram ploting
  • Previous by thread: Re: Timing puzzle
  • Next by thread: Re: Timing puzzle