Java recursion with one return statement
5
Is it possible to add the numbers 1 to n recursively in Java with one return statement? How would you change the standard solution:
public static int sum(int n) {
if(n == 1) return n;
else return n + sum(n - 1);
}
java recursion
edited Mar 22 at 14:19
Nicholas K
8,30161639
asked Mar 22 at 14:17
DCRDCR
2,50821850
add a comment |
5
Is it possible to add the numbers 1 to n recursively in Java with one return statement? How would you change the standard solution:
public static int sum(int n) {
if(n == 1) return n;
else return n + sum(n - 1);
}
java recursion
edited Mar 22 at 14:19
Nicholas K
8,30161639
asked Mar 22 at 14:17
DCRDCR
2,50821850
add a comment |
5
5
5
Is it possible to add the numbers 1 to n recursively in Java with one return statement? How would you change the standard solution:
public static int sum(int n) {
if(n == 1) return n;
else return n + sum(n - 1);
}
java recursion
edited Mar 22 at 14:19
Nicholas K
8,30161639
asked Mar 22 at 14:17
DCRDCR
2,50821850
Is it possible to add the numbers 1 to n recursively in Java with one return statement? How would you change the standard solution:
public static int sum(int n) {
if(n == 1) return n;
else return n + sum(n - 1);
}
java recursion
java recursion
edited Mar 22 at 14:19
Nicholas K
8,30161639
asked Mar 22 at 14:17
DCRDCR
2,50821850
edited Mar 22 at 14:19
Nicholas K
8,30161639
asked Mar 22 at 14:17
DCRDCR
2,50821850
edited Mar 22 at 14:19
Nicholas K
8,30161639
edited Mar 22 at 14:19
Nicholas K
8,30161639
edited Mar 22 at 14:19
Nicholas K
8,30161639
8,30161639
asked Mar 22 at 14:17
DCRDCR
2,50821850
asked Mar 22 at 14:17
DCRDCR
2,50821850
asked Mar 22 at 14:17
DCRDCR
2,50821850
2,50821850
add a comment |
add a comment |
4 Answers
4
active
oldest
votes
13
return n == 1 ? n : n + sum(n-1);
answered Mar 22 at 14:18
Grégory ElhaimerGrégory Elhaimer
1,606917
add a comment |
6
You could use simple maths without recursion:
public static int sum(int n) {
return n * (n + 1) / 2;
}
answered Mar 22 at 14:22
LinoLino
10.6k22143
Wow, that’s an amazing formula did you figure that out yourself?
– DCR
Mar 22 at 14:28
@DCR This problem has been known for quite a while, this formula is widely accessible on the internet
– Lino
Mar 22 at 14:30
2
If you want to get rid of the division use>> 1. There's no need to, though. The compiler will make this trivial optimization on its own. Exploiting integer overflow is bizarre.
– John Kugelman
Mar 22 at 18:37
add a comment |
3
Yes, by making use of the ternary operator :
public static int sum(int n) {
return n == 1 ? n : n + sum(n - 1);
}
answered Mar 22 at 14:19
Nicholas KNicholas K
8,30161639
add a comment |
0
public static int sum(int n) {
return n == 1 ? 1 : n + sum(n-1);
}
answered Mar 22 at 14:20
HadesZazifHadesZazif
494
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
});
}
});
draft saved
draft discarded
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%2f55301608%2fjava-recursion-with-one-return-statement%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
4 Answers
4
active
oldest
votes
4 Answers
4
active
oldest
votes
active
oldest
votes
active
oldest
votes
13
return n == 1 ? n : n + sum(n-1);
answered Mar 22 at 14:18
Grégory ElhaimerGrégory Elhaimer
1,606917
add a comment |
13
return n == 1 ? n : n + sum(n-1);
answered Mar 22 at 14:18
Grégory ElhaimerGrégory Elhaimer
1,606917
add a comment |
13
13
13
return n == 1 ? n : n + sum(n-1);
answered Mar 22 at 14:18
Grégory ElhaimerGrégory Elhaimer
1,606917
return n == 1 ? n : n + sum(n-1);
answered Mar 22 at 14:18
Grégory ElhaimerGrégory Elhaimer
1,606917
answered Mar 22 at 14:18
Grégory ElhaimerGrégory Elhaimer
1,606917
answered Mar 22 at 14:18
Grégory ElhaimerGrégory Elhaimer
1,606917
answered Mar 22 at 14:18
Grégory ElhaimerGrégory Elhaimer
1,606917
1,606917
add a comment |
add a comment |
6
You could use simple maths without recursion:
public static int sum(int n) {
return n * (n + 1) / 2;
}
answered Mar 22 at 14:22
LinoLino
10.6k22143
Wow, that’s an amazing formula did you figure that out yourself?
– DCR
Mar 22 at 14:28
@DCR This problem has been known for quite a while, this formula is widely accessible on the internet
– Lino
Mar 22 at 14:30
2
If you want to get rid of the division use>> 1. There's no need to, though. The compiler will make this trivial optimization on its own. Exploiting integer overflow is bizarre.
– John Kugelman
Mar 22 at 18:37
add a comment |
6
You could use simple maths without recursion:
public static int sum(int n) {
return n * (n + 1) / 2;
}
answered Mar 22 at 14:22
LinoLino
10.6k22143
Wow, that’s an amazing formula did you figure that out yourself?
– DCR
Mar 22 at 14:28
@DCR This problem has been known for quite a while, this formula is widely accessible on the internet
– Lino
Mar 22 at 14:30
2
If you want to get rid of the division use>> 1. There's no need to, though. The compiler will make this trivial optimization on its own. Exploiting integer overflow is bizarre.
– John Kugelman
Mar 22 at 18:37
add a comment |
6
6
6
You could use simple maths without recursion:
public static int sum(int n) {
return n * (n + 1) / 2;
}
answered Mar 22 at 14:22
LinoLino
10.6k22143
You could use simple maths without recursion:
public static int sum(int n) {
return n * (n + 1) / 2;
}
answered Mar 22 at 14:22
LinoLino
10.6k22143
edited Mar 22 at 18:57
answered Mar 22 at 14:22
LinoLino
10.6k22143
answered Mar 22 at 14:22
LinoLino
10.6k22143
answered Mar 22 at 14:22
LinoLino
10.6k22143
10.6k22143
Wow, that’s an amazing formula did you figure that out yourself?
– DCR
Mar 22 at 14:28
@DCR This problem has been known for quite a while, this formula is widely accessible on the internet
– Lino
Mar 22 at 14:30
2
If you want to get rid of the division use>> 1. There's no need to, though. The compiler will make this trivial optimization on its own. Exploiting integer overflow is bizarre.
– John Kugelman
Mar 22 at 18:37
add a comment |
Wow, that’s an amazing formula did you figure that out yourself?
– DCR
Mar 22 at 14:28
@DCR This problem has been known for quite a while, this formula is widely accessible on the internet
– Lino
Mar 22 at 14:30
2
If you want to get rid of the division use>> 1. There's no need to, though. The compiler will make this trivial optimization on its own. Exploiting integer overflow is bizarre.
– John Kugelman
Mar 22 at 18:37
Wow, that’s an amazing formula did you figure that out yourself?
– DCR
Mar 22 at 14:28
Wow, that’s an amazing formula did you figure that out yourself?
– DCR
Mar 22 at 14:28
@DCR This problem has been known for quite a while, this formula is widely accessible on the internet
– Lino
Mar 22 at 14:30
@DCR This problem has been known for quite a while, this formula is widely accessible on the internet
– Lino
Mar 22 at 14:30
2
2
If you want to get rid of the division use
>> 1. There's no need to, though. The compiler will make this trivial optimization on its own. Exploiting integer overflow is bizarre.– John Kugelman
Mar 22 at 18:37
If you want to get rid of the division use
>> 1. There's no need to, though. The compiler will make this trivial optimization on its own. Exploiting integer overflow is bizarre.– John Kugelman
Mar 22 at 18:37
add a comment |
3
Yes, by making use of the ternary operator :
public static int sum(int n) {
return n == 1 ? n : n + sum(n - 1);
}
answered Mar 22 at 14:19
Nicholas KNicholas K
8,30161639
add a comment |
3
Yes, by making use of the ternary operator :
public static int sum(int n) {
return n == 1 ? n : n + sum(n - 1);
}
answered Mar 22 at 14:19
Nicholas KNicholas K
8,30161639
add a comment |
3
3
3
Yes, by making use of the ternary operator :
public static int sum(int n) {
return n == 1 ? n : n + sum(n - 1);
}
answered Mar 22 at 14:19
Nicholas KNicholas K
8,30161639
Yes, by making use of the ternary operator :
public static int sum(int n) {
return n == 1 ? n : n + sum(n - 1);
}
answered Mar 22 at 14:19
Nicholas KNicholas K
8,30161639
answered Mar 22 at 14:19
Nicholas KNicholas K
8,30161639
answered Mar 22 at 14:19
Nicholas KNicholas K
8,30161639
answered Mar 22 at 14:19
Nicholas KNicholas K
8,30161639
8,30161639
add a comment |
add a comment |
0
public static int sum(int n) {
return n == 1 ? 1 : n + sum(n-1);
}
answered Mar 22 at 14:20
HadesZazifHadesZazif
494
add a comment |
0
public static int sum(int n) {
return n == 1 ? 1 : n + sum(n-1);
}
answered Mar 22 at 14:20
HadesZazifHadesZazif
494
add a comment |
0
0
0
public static int sum(int n) {
return n == 1 ? 1 : n + sum(n-1);
}
answered Mar 22 at 14:20
HadesZazifHadesZazif
494
public static int sum(int n) {
return n == 1 ? 1 : n + sum(n-1);
}
answered Mar 22 at 14:20
HadesZazifHadesZazif
494
answered Mar 22 at 14:20
HadesZazifHadesZazif
494
answered Mar 22 at 14:20
HadesZazifHadesZazif
494
answered Mar 22 at 14:20
HadesZazifHadesZazif
494
494
add a comment |
add a comment |
draft saved
draft discarded
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.
draft saved
draft discarded
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%2f55301608%2fjava-recursion-with-one-return-statement%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
