Match the following :

Algorithm Time Complexity

A. Bellman-ford 1. O(n)

B. Optimal binary search tree(OBST) 2. O(n²)

C. All pairs shortest path 3. O(n³)

D. Dijkstra’s algorithm 4. O(n logn)

Question

Algorithm	Time Complexity
A. Bellman-ford	1. O(n)
B. Optimal binary search tree(OBST)	2. O(n²)
C. All pairs shortest path	3. O(n³)
D. Dijkstra’s algorithm	4. O(n logn)

Match the following : Algorithm Time Complexity A. Bellman-ford 1. O(n) B. Optimal binary search tree(OBST) 2. O(n2) C. All pairs shortest path 3. O(n3) D. Dijkstra’s algorithm 4. O(n logn)