Loading
.
.
.
Welcome to KSRLearner
KSR LEARNER
Explore, Learn & Grow
Back to Legend Quizzes
Question 1 of 10
Score: 0
Legend Level - Quiz 3
What is the time complexity of the A* pathfinding algorithm?
O(1)
O(n)
O(n log n)
O(b^d) where b is branching factor and d is depth
Previous
Next Question
