Edit - Software Engineering Stack Exchange

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

Rev

By definition, a stack is a LIFO collection: Last in, first out. A queue is a FIFO collection.

John R. Strohm
– John R. Strohm

2013-06-07 16:02:55 +00:00
Commented Jun 7, 2013 at 16:02
So is a stack the only acceptable data structure? If so, why?

Lorenzo Dematté
– Lorenzo Dematté

2013-06-08 13:07:30 +00:00
Commented Jun 8, 2013 at 13:07
@JohnR.Strohm: Fixed :-)

Brendan
– Brendan

2013-06-09 00:57:12 +00:00
Commented Jun 9, 2013 at 0:57
2

For languages without recursion (direct or mutal), it's possible to statically-allocate for each method a variable which will identify the place from which that method was last called. If the linker is aware of such things, it can allocate such variables in a fashion which will be no worse than what a stack would do if every statically-possible execution path were actually taken.

supercat
– supercat

2014-06-26 01:24:27 +00:00
Commented Jun 26, 2014 at 1:24

Add a comment |

Correct minor typos or mistakes
Clarify meaning without changing it
Add related resources or links
Always respect the author’s intent
Don’t use edits to reply to the author

create code fences with backticks ` or tildes ~
```
like so
```
add language identifier to highlight code
```python
def function(foo):
print(foo)
```
put returns between paragraphs
for linebreak add 2 spaces at end
_italic_ or **bold**
indent code by 4 spaces
backtick escapes `like _so_`
quote by placing > at start of line
to make links (use https whenever possible)

<https://example.com>

[example](https://example.com)

<a href="https://example.com">example</a>

formatting help »
answering help »