Does a reference in a recursive function fill up the stack?
up vote
0
down vote
favorite
I know that in a recursive functions you should try to use as less parameters as possible and make as much global, in order to fill the stack less, but does it make any difference that instead of making things global, you use them with a reference? I know that this might be different on different compilers. I am using C++ with the compiler GCC.
recursion gcc reference stack
add a comment |
up vote
0
down vote
favorite
I know that in a recursive functions you should try to use as less parameters as possible and make as much global, in order to fill the stack less, but does it make any difference that instead of making things global, you use them with a reference? I know that this might be different on different compilers. I am using C++ with the compiler GCC.
recursion gcc reference stack
References will take up less memory when passing to a function than a whole object will. The issue is with a recursive function, depending on how reentrant it is, it will take up that much space in the parameter list * the size of your parameters. If your recursive function never quits, regardless of the size of the parameters or any parameters at all, it will cause a stack overflow. So unless you are going from a large object in parameter list to a reference, and you have very limited memory space, making sure it exits correctly is probably the bigger concern. Tl;Dr references take less space
– DMarczak
Nov 12 at 3:26
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
I know that in a recursive functions you should try to use as less parameters as possible and make as much global, in order to fill the stack less, but does it make any difference that instead of making things global, you use them with a reference? I know that this might be different on different compilers. I am using C++ with the compiler GCC.
recursion gcc reference stack
I know that in a recursive functions you should try to use as less parameters as possible and make as much global, in order to fill the stack less, but does it make any difference that instead of making things global, you use them with a reference? I know that this might be different on different compilers. I am using C++ with the compiler GCC.
recursion gcc reference stack
recursion gcc reference stack
asked Nov 12 at 3:13
Antoniu Fic
1
1
References will take up less memory when passing to a function than a whole object will. The issue is with a recursive function, depending on how reentrant it is, it will take up that much space in the parameter list * the size of your parameters. If your recursive function never quits, regardless of the size of the parameters or any parameters at all, it will cause a stack overflow. So unless you are going from a large object in parameter list to a reference, and you have very limited memory space, making sure it exits correctly is probably the bigger concern. Tl;Dr references take less space
– DMarczak
Nov 12 at 3:26
add a comment |
References will take up less memory when passing to a function than a whole object will. The issue is with a recursive function, depending on how reentrant it is, it will take up that much space in the parameter list * the size of your parameters. If your recursive function never quits, regardless of the size of the parameters or any parameters at all, it will cause a stack overflow. So unless you are going from a large object in parameter list to a reference, and you have very limited memory space, making sure it exits correctly is probably the bigger concern. Tl;Dr references take less space
– DMarczak
Nov 12 at 3:26
References will take up less memory when passing to a function than a whole object will. The issue is with a recursive function, depending on how reentrant it is, it will take up that much space in the parameter list * the size of your parameters. If your recursive function never quits, regardless of the size of the parameters or any parameters at all, it will cause a stack overflow. So unless you are going from a large object in parameter list to a reference, and you have very limited memory space, making sure it exits correctly is probably the bigger concern. Tl;Dr references take less space
– DMarczak
Nov 12 at 3:26
References will take up less memory when passing to a function than a whole object will. The issue is with a recursive function, depending on how reentrant it is, it will take up that much space in the parameter list * the size of your parameters. If your recursive function never quits, regardless of the size of the parameters or any parameters at all, it will cause a stack overflow. So unless you are going from a large object in parameter list to a reference, and you have very limited memory space, making sure it exits correctly is probably the bigger concern. Tl;Dr references take less space
– DMarczak
Nov 12 at 3:26
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53255512%2fdoes-a-reference-in-a-recursive-function-fill-up-the-stack%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
References will take up less memory when passing to a function than a whole object will. The issue is with a recursive function, depending on how reentrant it is, it will take up that much space in the parameter list * the size of your parameters. If your recursive function never quits, regardless of the size of the parameters or any parameters at all, it will cause a stack overflow. So unless you are going from a large object in parameter list to a reference, and you have very limited memory space, making sure it exits correctly is probably the bigger concern. Tl;Dr references take less space
– DMarczak
Nov 12 at 3:26