Complexity Analysis (Big O) - Exam Prep for Students

Complexity Analysis (Big O) - Implementations in Python - Advanced Concepts

Q. What is the time complexity of performing a breadth-first search (BFS) on a graph?

A. O(V)
B. O(E)
C. O(V + E)
D. O(V * E)

Solution

The time complexity of performing a breadth-first search (BFS) on a graph is O(V + E), where V is the number of vertices and E is the number of edges.

Correct Answer: C — O(V + E)

Learn More →

Showing 1 to 1 of 1 (1 Pages)

Complexity Analysis (Big O) - Implementations in Python - Advanced Concepts

On a scale of 0–10, how likely are you to recommend The Soulshift Academy?