QUIZZZ

CodeChefOpen on judge ↗

1..if T(n) = n2 √ n then A.T(n) = O(n2) B.T(n) = O(n2 log n) C.T(n) = O(n) D.T(n) = O(n3) 2..Which of the following is not a greedy algorithm? A.Bellman-Ford algorithm for single source shortest paths B.Prim's algorithm for minimum cost spanning tree C. Kruskal's algorithm for minimum cost spanning tree D.Dijkstra's algorithm for single source shortest paths 3..Find the number of divisor

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI