Services & Resources / Wolfram Forums
MathGroup Archive
*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: Re: Memory operations

  • To: mathgroup at
  • Subject: [mg65072] Re: [mg64988] Re: [mg64895] Memory operations
  • From: sir_puding at
  • Date: Tue, 14 Mar 2006 05:59:50 -0500 (EST)
  • References: <> <>
  • Reply-to: "sir_puding at" <mathgroup at>
  • Sender: owner-wri-mathgroup at

> I vote for changing the way you work.
> From my experience, For is the slowest loop in Mathematica.
> Add it to the way that mathematica manage memory with apend, and I think you
> will find it hard to make a less efficient program.
> regards
> yehuda

So, i think you can suggest best how to organize FIFO (or LIFO) query  in

Problem is that i do not know how many results from operations I'll
get (for example multiple root finding).


  • Prev by Date: Re: optimization nested in root-finding
  • Next by Date: Re: pictures of mathematics on a non-white background
  • Previous by thread: Re: Memory operations
  • Next by thread: Re: Re: Re: Memory operations