What is the iterative Function of the following recursive function
I am trying to make this recursion function be a closed form one but cannot seem to get it just right. I did get the fact that the base case should be n > 1 but got stuck after this point. I was wondering if you guys could please help.
public static int fi(int n){
if(n <=1 ) {
return 0;
} else {
return (int) (1 + Math.floor(n/2));
}
}
This is what i have so far:
public static int fi(int n){
int val = 0;
while(n > 1){
val += (int) Math.floor(n/2);
n = (int) Math.floor(n/2);
}
return val;
}
recursion iteration theory
edited Nov 22 at 17:55
LukeDev
205
asked Oct 25 at 1:34
Gonzalez Rojo
111
add a comment |
I am trying to make this recursion function be a closed form one but cannot seem to get it just right. I did get the fact that the base case should be n > 1 but got stuck after this point. I was wondering if you guys could please help.
public static int fi(int n){
if(n <=1 ) {
return 0;
} else {
return (int) (1 + Math.floor(n/2));
}
}
This is what i have so far:
public static int fi(int n){
int val = 0;
while(n > 1){
val += (int) Math.floor(n/2);
n = (int) Math.floor(n/2);
}
return val;
}
recursion iteration theory
edited Nov 22 at 17:55
LukeDev
205
asked Oct 25 at 1:34
Gonzalez Rojo
111
2
Where does fi() call itself? The first function doesn't look recursive.
– Leo Bartkus
Nov 22 at 18:00
add a comment |
I am trying to make this recursion function be a closed form one but cannot seem to get it just right. I did get the fact that the base case should be n > 1 but got stuck after this point. I was wondering if you guys could please help.
public static int fi(int n){
if(n <=1 ) {
return 0;
} else {
return (int) (1 + Math.floor(n/2));
}
}
This is what i have so far:
public static int fi(int n){
int val = 0;
while(n > 1){
val += (int) Math.floor(n/2);
n = (int) Math.floor(n/2);
}
return val;
}
recursion iteration theory
edited Nov 22 at 17:55
LukeDev
205
asked Oct 25 at 1:34
Gonzalez Rojo
111
I am trying to make this recursion function be a closed form one but cannot seem to get it just right. I did get the fact that the base case should be n > 1 but got stuck after this point. I was wondering if you guys could please help.
public static int fi(int n){
if(n <=1 ) {
return 0;
} else {
return (int) (1 + Math.floor(n/2));
}
}
This is what i have so far:
public static int fi(int n){
int val = 0;
while(n > 1){
val += (int) Math.floor(n/2);
n = (int) Math.floor(n/2);
}
return val;
}
recursion iteration theory
recursion iteration theory
edited Nov 22 at 17:55
LukeDev
205
asked Oct 25 at 1:34
Gonzalez Rojo
111
edited Nov 22 at 17:55
LukeDev
205
asked Oct 25 at 1:34
Gonzalez Rojo
111
edited Nov 22 at 17:55
LukeDev
205
edited Nov 22 at 17:55
LukeDev
205
edited Nov 22 at 17:55
LukeDev
205
205
asked Oct 25 at 1:34
Gonzalez Rojo
111
asked Oct 25 at 1:34
Gonzalez Rojo
111
asked Oct 25 at 1:34
Gonzalez Rojo
111
111
2
Where does fi() call itself? The first function doesn't look recursive.
– Leo Bartkus
Nov 22 at 18:00
add a comment |
2
Where does fi() call itself? The first function doesn't look recursive.
– Leo Bartkus
Nov 22 at 18:00
2
2
Where does fi() call itself? The first function doesn't look recursive.
– Leo Bartkus
Nov 22 at 18:00
Where does fi() call itself? The first function doesn't look recursive.
– Leo Bartkus
Nov 22 at 18:00
add a comment |
active
oldest
votes
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%2f52980102%2fwhat-is-the-iterative-function-of-the-following-recursive-function%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
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%2f52980102%2fwhat-is-the-iterative-function-of-the-following-recursive-function%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
2
Where does fi() call itself? The first function doesn't look recursive.
– Leo Bartkus
Nov 22 at 18:00