β I'm rly bad at recursion
we've started w Recursion abt 2 weeks ago and I'm rly struggling w it. idk at what exactly bc I'm bad at the basics but I can give u an example from my hw
AI mean, recursion is really just "a function that calls itself"
PThis isn't an SMS btw, you're not limited to 140 characters
PRecursion can be hard to wrap your head around, but it's essentially another way to loop
AHere's a very useless recursive function
οΏ½but it's so complicated
AAight, what's complicated about my example?
οΏ½urs is simple
οΏ½I understand it
οΏ½but I doubt I'd be able to write it myself
BIf you write complicated code, obviously it'll be complicated.
οΏ½it's not even that complicated
BRecursion is very easy to understand.
it is simply a function that calls itself.
it is simply a function that calls itself.
οΏ½the first question in my hw is to code a function that gets an int num and returns the sum of all the nums 0-num but I find it so difficult to even understand how to do
οΏ½1 sec I'm sending my code
οΏ½.
public static int Sum1Ton(int n)
{
if(n/10 == 0)
return;
Sum1Ton(n-1)
return n;
}
public static int Sum1Ton(int n)
{
if(n/10 == 0)
return;
Sum1Ton(n-1)
return n;
}
οΏ½like idk what to do
Ccan u write this itrative? (basically with loops)
MPosting Code Snippets
To post a code snippet type the following:```cs
// code here
```
Notes:
- Get an example by typing in the chat.
- Change the language by replacing with the language of your choice (for example or ).
- If your code is too long, you can post it to https://paste.mod.gg/ and share the link.
οΏ½no
οΏ½Cwhat i meant, is can u write it not recursive (a for loop would be preferable)
from there we could start to work out the recursive version
from there we could start to work out the recursive version
οΏ½oh ok
C(but i need a quick ciggy break, so ill be back in 5)
οΏ½
Cthat description 
and ur code do different things
and ur code do different things
οΏ½oh right
Cso do u need to get the sum of digits of a given number, or just the sum of 1 to the given number
Csounds like it should be the latter (even from method name)
οΏ½I need the sum of all the numbers from 0 - num
οΏ½idk y I coded this
Cokay then try to write a loop for that first (forget about recursion for now)
οΏ½οΏ½this is it I think
Cyep thats correct
Ckeep this one in mind
Cwe split the code a bit up, translate it to recursion and then wire it together again
οΏ½I think this is the type of code that u go to the end and then count on the way back
Cthats correct (i was about to type that)
οΏ½so it'd be return n+i or smth like that
Cso basically ur for loop would have to do it in reverse order, where starts with , can u write that as for loop?
οΏ½I think so
Cthen show some code ;p
οΏ½οΏ½?
οΏ½wait sorry
Cto be honest, because u wrote it in reverse order now (which is correct), i saw a bug in ur earlier loop 
Clets fix that one quickly
Clets say is 2,
so the result should be 1 + 2, so its 3
now think about step by step what that for loop does
so the result should be 1 + 2, so its 3
now think about step by step what that for loop does
οΏ½ur right