Algorithms
|
Question 8
|
where O(n) stands for order n is:
|
O(n)
|
|
|
O(n2)
|
|
|
O(n3)
|
|
|
O(3n2)
|
|
|
O(1.5n2)
|
|
|
B, C, D and E
|
Question 8 Explanation:
⇒ In this ‘n’ is constant. So, n is added to n times itself which is O(n2).
Hence, (a) is wrong. And rest (B), (C), (D), (E) are correct.
Correct Answer: F
Question 8 Explanation:
⇒ In this ‘n’ is constant. So, n is added to n times itself which is O(n2).
Hence, (a) is wrong. And rest (B), (C), (D), (E) are correct.