Multiple choices 40/50
Let f(n) be the complexity of the merge sort algorithm on the sequence of size n in terms of the number of comparisons. The recurrence relation of f(n) is as follows: f(n) = a.f(n/2) + n, with n even. Determine a.
(Choose 1 answer)
A. 1
B. 2
C. 3
D. 4
Next
E. None of the other choices is correct
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
