Multiple choices 31/50
(Choose 1 answer)
Give the "best" big-O notation to describe the complexity of the algorithm that prints all bit strings of length n.
A. (i)
B. (ii)
C. (iii)
D. None of the other choices is correct.
Next
E. (iv)
(i) O(2")
(ii) O(n)
(iii) O(n²)
(iv) O(nlogn)
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
