Question 10429 – Algorithms
February 13, 2024Question 14316 – Algorithms
February 13, 2024Question 10435 – Algorithms
where O(n) stands for order n is:
Correct Answer: F
Question 36 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.
O(n)
O(n2)
O(n3)
O(3n2)
O(1.5n2)
B, C, D and E
Subscribe
Login
0 Comments