Arrange the following algorithms from the most efficient to least efficient…

2026

Arrange the following algorithms from the most efficient to least efficient using their standard worst-case time complexities:

  • A. Kruskal's Algorithm

  • B. Breadth-First Search (BFS)

  • C. Bellman-Ford Algorithm

  • D. Dijkstra's Algorithm

  • E. Edmonds-Karp Algorithm

Choose the correct sequence.

  1. A.

    B, D, A, E, C

  2. B.

    E, C, A, D, B

  3. C.

    B, D, A, C, E

  4. D.

    B, C, A, E, D

Attempted by 130 students.

Show answer & explanation

Correct answer: C

Correct sequence: B, D, A, C, E.

  • BFS: O(V + E), usually the lightest among the listed algorithms.

  • Dijkstra: commonly O((V + E) log V) with a priority queue for non-negative weighted graphs.

  • Kruskal: O(E log E), mainly due to sorting edges.

  • Bellman-Ford: O(VE).

  • Edmonds-Karp: O(VE²), which is heavier than Bellman-Ford.

So the order from most efficient to least efficient is B, D, A, C, E.

Explore the full course: Coding For Placement