Aptitude
Reasoning
Verbal
Technical
AI
Exams
Search
Technical
/
Algorithms
/
Exercises
/
Exercise 3
Algorithms
hard
0/15 answered
Q1
What is the time complexity of Dijkstra's algorithm with a binary heap?
A
O(V + E)
B
O(V log V + E)
C
O(E log V)
D
O((V + E) log V)
← Prev
1 / 15
Next →
← Exercise 2
Exercise 3 of 7
Exercise 4 →