| Describe recursion as you understand it. Have you encountered recursion before? How is the word "fractal" related to recursion? |
Well written and fractal is better to see once than hear a hundred times |
0.9/1 |
| Investigate the limit of what the largest factorial value can be calculated with a certain data type. |
It would be necessary to test for each type with an unsigned type, but it seems that this will not give anything, as in the case of long long. Or maybe it would for smaller types? |
1/1 |
| Investigate how many calls the function will make before it terminates. |
For some reason everyone misunderstood this task, there was no need to investigate factorial or any other specific formula here |
0.1/1 |
| Print the numbers from 1 to n. |
It's good that we managed with one parameter in the function, many people write this option with two parameters. |
0.9/1 |
| Print the numbers from n to 1. |
Here we should look at these two almost identical tasks and draw a certain conclusion, it would be difficult to do this for those who did the first task with two parameters, and the second with one. |
0.9/1 |
| Write a function to calculate the sum of two numbers a+b. |
in case of negative second term this will not work |
1.8/2 |
| Print a string character by character (as an array). |
Our topic is not pointers, but recursion... even the line we print/flip is called that. |
0.5/1.5 |
| Print a string character by character (as an array). The string should be output backwards, reversed. |
Our topic is not pointers, but recursion... even the line we print/flip is called that. |
0.5/1.5 |
| Total: |
This week 7 is a very good grade because almost no one did the three tasks. |
6.6/10 |