Breadth First Search Quiz


Breadth First Search Quiz

Question 1
What is the worst case performance, expressed in Big-O notation, of the Breadth First Search algorithm?
A
O(|E|+|V|)
B
O(log(n))
C
O(n)
D
O(|V||E|)
E
O(n^2)
There is 1 question to complete.
Return
Shaded items are complete.
1
Return