▲ 32 ▼ Why does the for loop repeat in this recursion? (lemm.ee) submitted 2 years ago by milon@lemm.ee to c/programming@programming.dev 30 comments fedilink hide all child comments I used the debugger to examine this code but not understanding a couple areas. Why does the for loop repeat after it exits to print a new line? If it exits the loop, shouldn't it be done with it? Why is n incremented and not i as stated with i++? int main(void) { int height = get_int("Height: "); draw(height); } void draw(int n) { if (n <= 0) { return; } draw(n - 1); for (int i = 0; i < n; i++) { printf("#"); } printf("\n"); }
[–] xmunk@sh.itjust.works 2 points 2 years ago (1 child) So is my example of Height 3 in line with your expectations? permalink fedilink source parent hideshow 2 child comments replies: [–] milon@lemm.ee [S] 1 point 2 years ago (1 child) Yep permalink fedilink source parent hideshow 2 child comments replies: [–] xmunk@sh.itjust.works 2 points 2 years ago (1 child) I wrote an equivalent version just using nested loops - reading it might help you understand why the recursion works the way it does. permalink fedilink source parent hideshow 2 child comments replies: [–] milon@lemm.ee [S] 1 point 2 years ago (1 child) Thanks. I did see that. I have a general understanding of how recursion works I think where the function calls itself again and again but I don't get why the code (for loop) below the draw(n - 1) is recursive. permalink fedilink source parent hideshow 2 child comments replies: [–] xmunk@sh.itjust.works 5 points 2 years ago The code below the draw(n - 1) isn't recursive... the call to draw(n - 1) is the recursion. Sometimes, it can be helpful to invert recursion. Think about what draw(0) would be and write it down... then compute draw(1) using the value you previously computed for draw(0). permalink fedilink source parent
[–] milon@lemm.ee [S] 1 point 2 years ago (1 child) Yep permalink fedilink source parent hideshow 2 child comments replies: [–] xmunk@sh.itjust.works 2 points 2 years ago (1 child) I wrote an equivalent version just using nested loops - reading it might help you understand why the recursion works the way it does. permalink fedilink source parent hideshow 2 child comments replies: [–] milon@lemm.ee [S] 1 point 2 years ago (1 child) Thanks. I did see that. I have a general understanding of how recursion works I think where the function calls itself again and again but I don't get why the code (for loop) below the draw(n - 1) is recursive. permalink fedilink source parent hideshow 2 child comments replies: [–] xmunk@sh.itjust.works 5 points 2 years ago The code below the draw(n - 1) isn't recursive... the call to draw(n - 1) is the recursion. Sometimes, it can be helpful to invert recursion. Think about what draw(0) would be and write it down... then compute draw(1) using the value you previously computed for draw(0). permalink fedilink source parent
[–] xmunk@sh.itjust.works 2 points 2 years ago (1 child) I wrote an equivalent version just using nested loops - reading it might help you understand why the recursion works the way it does. permalink fedilink source parent hideshow 2 child comments replies: [–] milon@lemm.ee [S] 1 point 2 years ago (1 child) Thanks. I did see that. I have a general understanding of how recursion works I think where the function calls itself again and again but I don't get why the code (for loop) below the draw(n - 1) is recursive. permalink fedilink source parent hideshow 2 child comments replies: [–] xmunk@sh.itjust.works 5 points 2 years ago The code below the draw(n - 1) isn't recursive... the call to draw(n - 1) is the recursion. Sometimes, it can be helpful to invert recursion. Think about what draw(0) would be and write it down... then compute draw(1) using the value you previously computed for draw(0). permalink fedilink source parent
[–] milon@lemm.ee [S] 1 point 2 years ago (1 child) Thanks. I did see that. I have a general understanding of how recursion works I think where the function calls itself again and again but I don't get why the code (for loop) below the draw(n - 1) is recursive. permalink fedilink source parent hideshow 2 child comments replies: [–] xmunk@sh.itjust.works 5 points 2 years ago The code below the draw(n - 1) isn't recursive... the call to draw(n - 1) is the recursion. Sometimes, it can be helpful to invert recursion. Think about what draw(0) would be and write it down... then compute draw(1) using the value you previously computed for draw(0). permalink fedilink source parent
[–] xmunk@sh.itjust.works 5 points 2 years ago The code below the draw(n - 1) isn't recursive... the call to draw(n - 1) is the recursion. Sometimes, it can be helpful to invert recursion. Think about what draw(0) would be and write it down... then compute draw(1) using the value you previously computed for draw(0). permalink fedilink source parent