Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
Drexel University or The Math Forum.
|
|
Brentt
Posts:
55
Registered:
9/24/11
|
|
Making a stack.
Posted:
Oct 22, 2012 2:07 AM
|
|
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
that.
Any ideas?
|
|
|
|
