Multiple choices 16/50
(Choose 1 answer)
Find the output of the recursive algorithm if input n = 5.
procedure TT(n: integer);
If n=1 then f(1):=0 else f(n):=f(n-1)*n;
A. -120
B. -240
C. 0
D. 120
Next
E. 240
1
2
3
4
5
6
7
8
9
10
11 12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41 42
43
44
45 46 47 48
49 50
