47
Multiple choices 47/50
(Choose 1 answer)
Select the statement that is most correct.
Basically, the complexity of finding the position of the minimum value in a doubly-linked list of integer numbers is
A. O(1)
B. O(n)
C. O(log n)
Next
D. O(n^2)
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
