— SteemCN

Task	Comment	Grade
_{Describe recursion as you understand it. Have you encountered recursion before? How is the word "fractal" related to recursion?}	_{Generally true, but very brief}	0.5/1
_{Investigate the limit of what the largest factorial value can be calculated with a certain data type..}	_{And here it's the other way around)) Even the code was created for verification, even all unsigned ones were checked (but it didn't work). Although I'm not sure if I should investigate the actual types here}	1+/1
_{Investigate how many calls the function will make before it terminates.}	_{And why is everyone in this problem discussing factorial... There are some correct words, but overall this is not what I wanted to get across here}	0.2/1
_{Print the numbers from 1 to n.}	_{Absolutely true)))}	1/1
_{Print the numbers from n to 1.}	_{As they say - "in the apple!" I don't know how the translator will handle this... maybe "Exactly!")). But here the one who publishes the answer later has a slight advantage over those who answered earlier. No matter how much he hides the comments}	1+/1
_{Write a function to calculate the sum of two numbers a+b.}	_{I wouldn't say that recursion will calculate the sum faster, rather the opposite - longer. But such tasks will allow us to better understand recursion.}	1.8/2
_{Print a string character by character (as an array).}	_ok	1.4+/1.5
_{Print a string character by character (as an array). The string should be output backwards, reversed.}	_ok	1.4+/1.5
_Total:		8.3/10