Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with stack
Search options answers only
not deleted
user 8669
A LIFO (Last In, First Out) data structure.
41
votes
Why does the call stack have a static maximum size?
Those data structures typically have properties the OS stack has not:
Linked lists don't require contiguous address space. So they can add a piece of memory from wherever they want when they grow. … On the other hand the OS stack needs to keep pointers to the stack valid until the function to whose frame the target belongs returns. …
- 5,787