• 🎮Indie game dev
  • 💬Adding content to programming.dev

posting things from the 160+ rss feeds I follow. You should see me post links in two chunks for when im reading stuff, once in the morning and once in the evening ET. If you want some of my sources for certain communities feel free to dm

  • 58 Posts
  • 24 Comments
Joined 11 months ago
cake
Cake day: August 4th, 2023

help-circle




































  • When the draw function calls itself it yields control to that new function its calling. When that function ends it takes back control and continues doing what it was doing.

    This means all of the for loops in all of the functions will execute. Draw(1) will do the for loop and then return as it hits the end of the function (standard behaviour when you reach the end of a function even if theres no return statement). Then draw(2) will do the for loop as it gets back control now that draw(1) is done and then return, etc. all the way up

    All parts of a function are recursive, theres no such thing as a non recursive part


  • Didnt say to go anywhere, just said that people on .world cant see content from hexbear on lemmy.ml posts shown by those comment counts above even though lemmy.ml federates with hexbear. (hexbear used since its the best example of a large blocked instance that can showcase this well. Could have also used .world, .ml and beehaw and same point stands)

    Same logic would apply to .world federating with threads. People on lemmy.dbzer0 for example wont see content from threads on .world posts or communities even if .world federates with threads

    Just wanted to put a counterpoint to you saying people would need to deal with it indirectly which isnt true proven by the above. You dont need to strawman it by making it a different point


  • This code has a recursive call (function calls itself) within the function so that has to be taken into account when tracing it

    This would make the function execute multiple times so the for loop would end up executing multiple times.

    Lets say main calls draw with a height value of 10 (draw(10)). First it sees that n is greater than 0 so it keeps going. Then it calls the draw function with a value of 10 - 1 aka 9. Now its executing in the draw(9) function. Greater than 0 so continues and calls draw(8). etc. all the way down to draw(0) where it sees that n is equal to 0 so returns out of the function due to the return statement.

    Now that draw(0) finished executing draw(1) can keep going and goes to the for loop. Here it prints 1 # and then prints a new line (and then returns since it hit the end of the function). Now that draw(1) is done draw(2) can keep going and prints 2 #'s and then prints a new line (and then returns). This keeps going all the way up to the initial draw call, draw(10) which prints 10 #'s and then a new line, returns, and then the main function keeps going but theres nothing after that so it returns and the execution ends.

    The effect from coming back after the recursive calls makes it seem like n is increasing but its just different calls to the same function. i is taken into account for but printing the amount of #'s since thats whats within that loop