MathGroup Archive 2012

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

Search the Archive

Making a stack.

  • To: mathgroup at
  • Subject: [mg128464] Making a stack.
  • From: Brentt <brenttnewman at>
  • Date: Mon, 22 Oct 2012 02:03:32 -0400 (EDT)
  • Delivered-to:
  • Delivered-to:
  • Delivered-to:
  • Delivered-to:

Hi, I'm trying to make stack functions like enqueue and dequeue to
demonstrate algorithms. I know enqueue would do pretty much the same thing
as AppendTo, but I want the arguments reversed and it to be called
"enqueue". I figured this would work:

enqueue[x_, queue_] := AppendTo[queue, x];

But it spits out red. I tried to tinker with the evaluation order but to no
avail. Is anyway to make this work? I want the functions to work like they
would in a procedural language (I'm not using a procedural language because
I want to accompany the algorithms with visualizations---i.e. it's for a
demonstration project). I know I can just use Set when I want to que
something, but I was hoping to figure out a way to make the code look like
procedural code, and I'm guessing Mathematica is flexible enough to do

Any ideas?

  • Prev by Date: OutputResponse gives funny results
  • Next by Date: Re: Making a stack.
  • Previous by thread: Re: OutputResponse gives funny results
  • Next by thread: Re: Making a stack.