Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2006
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2006

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

Search the Archive

Re: Efficiency of repeatedly appending to a List

  • To: mathgroup at smc.vnet.net
  • Subject: [mg71234] Re: Efficiency of repeatedly appending to a List
  • From: Jon Harrop <jon at ffconsultancy.com>
  • Date: Sat, 11 Nov 2006 03:38:31 -0500 (EST)
  • References: <200611081107.GAA21892@smc.vnet.net> <eiurf1$gct$1@smc.vnet.net>

János wrote:
> Appending to large lists are very expensive.  I wish Mathemetica has
> had other constructs handy like LIFO, FIFO,  and UFO :)

If I implement a Mathematica package to provide various data structures and
algorithms, would anyone here buy it?

-- 
Dr Jon D Harrop, Flying Frog Consultancy
Objective CAML for Scientists
http://www.ffconsultancy.com/products/ocaml_for_scientists


  • Prev by Date: [Help Needed] Function to solve polynomial
  • Next by Date: change of variables
  • Previous by thread: Re: Efficiency of repeatedly appending to a List
  • Next by thread: Re: Efficiency of repeatedly appending to a List