Recursive c++ function to print out the elements of a fibonacci tree
So far I have been able to use recursion to print out the fibonacci sequence. For example, the first 6 terms (including the 0'th term) in the sequence is:
6
13 8 5 3 2 1 1
but Im not sure how i'm supposed to use this to print out the entirety of a fibonacci tree. When the program input is 6, it's supposed to print:
6
13 8 5 3 2 1 1 1 2 1 1 3 2 1 1 1 5 3 2 1 1 1 2 1 1
and my code so far is:
#include <iostream>
#include <math.h>
#include <vector>
#include <string>
using namespace std;
std::vector<int> list;
int fib(int num);
int main() {
int input, depth = 0, leafs = 0, size = 0;
cin >> input;
int temp = input;
while (temp >= 0) {
cout << fib(temp) << " ";
temp--;
}
return 0;
}
int fib(int n) {
if (n <= 1) {
return 1;
} else {
return fib(n-1) + fib(n-2);
}
}
c++ recursion fibonacci
asked Nov 25 '18 at 12:32
Dov RoyalDov Royal
44
add a comment |
So far I have been able to use recursion to print out the fibonacci sequence. For example, the first 6 terms (including the 0'th term) in the sequence is:
6
13 8 5 3 2 1 1
but Im not sure how i'm supposed to use this to print out the entirety of a fibonacci tree. When the program input is 6, it's supposed to print:
6
13 8 5 3 2 1 1 1 2 1 1 3 2 1 1 1 5 3 2 1 1 1 2 1 1
and my code so far is:
#include <iostream>
#include <math.h>
#include <vector>
#include <string>
using namespace std;
std::vector<int> list;
int fib(int num);
int main() {
int input, depth = 0, leafs = 0, size = 0;
cin >> input;
int temp = input;
while (temp >= 0) {
cout << fib(temp) << " ";
temp--;
}
return 0;
}
int fib(int n) {
if (n <= 1) {
return 1;
} else {
return fib(n-1) + fib(n-2);
}
}
c++ recursion fibonacci
asked Nov 25 '18 at 12:32
Dov RoyalDov Royal
44
IMHO your stop condition seems wrong should be: if (n <= 2) { return n;}
– OznOg
Nov 25 '18 at 12:39
add a comment |
So far I have been able to use recursion to print out the fibonacci sequence. For example, the first 6 terms (including the 0'th term) in the sequence is:
6
13 8 5 3 2 1 1
but Im not sure how i'm supposed to use this to print out the entirety of a fibonacci tree. When the program input is 6, it's supposed to print:
6
13 8 5 3 2 1 1 1 2 1 1 3 2 1 1 1 5 3 2 1 1 1 2 1 1
and my code so far is:
#include <iostream>
#include <math.h>
#include <vector>
#include <string>
using namespace std;
std::vector<int> list;
int fib(int num);
int main() {
int input, depth = 0, leafs = 0, size = 0;
cin >> input;
int temp = input;
while (temp >= 0) {
cout << fib(temp) << " ";
temp--;
}
return 0;
}
int fib(int n) {
if (n <= 1) {
return 1;
} else {
return fib(n-1) + fib(n-2);
}
}
c++ recursion fibonacci
asked Nov 25 '18 at 12:32
Dov RoyalDov Royal
44
So far I have been able to use recursion to print out the fibonacci sequence. For example, the first 6 terms (including the 0'th term) in the sequence is:
6
13 8 5 3 2 1 1
but Im not sure how i'm supposed to use this to print out the entirety of a fibonacci tree. When the program input is 6, it's supposed to print:
6
13 8 5 3 2 1 1 1 2 1 1 3 2 1 1 1 5 3 2 1 1 1 2 1 1
and my code so far is:
#include <iostream>
#include <math.h>
#include <vector>
#include <string>
using namespace std;
std::vector<int> list;
int fib(int num);
int main() {
int input, depth = 0, leafs = 0, size = 0;
cin >> input;
int temp = input;
while (temp >= 0) {
cout << fib(temp) << " ";
temp--;
}
return 0;
}
int fib(int n) {
if (n <= 1) {
return 1;
} else {
return fib(n-1) + fib(n-2);
}
}
c++ recursion fibonacci
c++ recursion fibonacci
asked Nov 25 '18 at 12:32
Dov RoyalDov Royal
44
asked Nov 25 '18 at 12:32
Dov RoyalDov Royal
44
asked Nov 25 '18 at 12:32
Dov RoyalDov Royal
44
asked Nov 25 '18 at 12:32
Dov RoyalDov Royal
44
asked Nov 25 '18 at 12:32
Dov RoyalDov Royal
44
44
IMHO your stop condition seems wrong should be: if (n <= 2) { return n;}
– OznOg
Nov 25 '18 at 12:39
add a comment |
IMHO your stop condition seems wrong should be: if (n <= 2) { return n;}
– OznOg
Nov 25 '18 at 12:39
IMHO your stop condition seems wrong should be: if (n <= 2) { return n;}
– OznOg
Nov 25 '18 at 12:39
IMHO your stop condition seems wrong should be: if (n <= 2) { return n;}
– OznOg
Nov 25 '18 at 12:39
add a comment |
1 Answer
1
active
oldest
votes
If you want to print everything, you need also to all the function to print everything:
int fib(int n) {
if (n <= 1) {
std::cout << 1 << " ";
return 1;
} else {
int f1 = fib(n-1);
int f2 = fib(n-2);
std::cout << f1 + f2 << " ";
return f1 + f2;
}
}
answered Nov 25 '18 at 12:36
Matthieu BrucherMatthieu Brucher
16.5k32143
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
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%2f53467475%2frecursive-c-function-to-print-out-the-elements-of-a-fibonacci-tree%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
If you want to print everything, you need also to all the function to print everything:
int fib(int n) {
if (n <= 1) {
std::cout << 1 << " ";
return 1;
} else {
int f1 = fib(n-1);
int f2 = fib(n-2);
std::cout << f1 + f2 << " ";
return f1 + f2;
}
}
answered Nov 25 '18 at 12:36
Matthieu BrucherMatthieu Brucher
16.5k32143
add a comment |
If you want to print everything, you need also to all the function to print everything:
int fib(int n) {
if (n <= 1) {
std::cout << 1 << " ";
return 1;
} else {
int f1 = fib(n-1);
int f2 = fib(n-2);
std::cout << f1 + f2 << " ";
return f1 + f2;
}
}
answered Nov 25 '18 at 12:36
Matthieu BrucherMatthieu Brucher
16.5k32143
add a comment |
If you want to print everything, you need also to all the function to print everything:
int fib(int n) {
if (n <= 1) {
std::cout << 1 << " ";
return 1;
} else {
int f1 = fib(n-1);
int f2 = fib(n-2);
std::cout << f1 + f2 << " ";
return f1 + f2;
}
}
answered Nov 25 '18 at 12:36
Matthieu BrucherMatthieu Brucher
16.5k32143
If you want to print everything, you need also to all the function to print everything:
int fib(int n) {
if (n <= 1) {
std::cout << 1 << " ";
return 1;
} else {
int f1 = fib(n-1);
int f2 = fib(n-2);
std::cout << f1 + f2 << " ";
return f1 + f2;
}
}
answered Nov 25 '18 at 12:36
Matthieu BrucherMatthieu Brucher
16.5k32143
answered Nov 25 '18 at 12:36
Matthieu BrucherMatthieu Brucher
16.5k32143
answered Nov 25 '18 at 12:36
Matthieu BrucherMatthieu Brucher
16.5k32143
answered Nov 25 '18 at 12:36
Matthieu BrucherMatthieu Brucher
16.5k32143
16.5k32143
add a comment |
add a comment |
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.
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%2f53467475%2frecursive-c-function-to-print-out-the-elements-of-a-fibonacci-tree%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
IMHO your stop condition seems wrong should be: if (n <= 2) { return n;}
– OznOg
Nov 25 '18 at 12:39