Computer Science · Search Algorithms

What is the worst-case time complexity of Best-First Search (where b is the branching factor and d is the maximum depth)?

Verified Solution4 OptionsUpdated: October 2026👁️1 View

Correct answer

O(bd)

Save this question and verified answer as a clean study sheet with live clickable link.

👥

Challenge your peer aspirants on WhatsApp or Telegram to solve this question!

Online Test Series

Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.

Chapter Practice

Want more practice questions on Search Algorithms?

Solve complete topic-wise tests with detailed solutions on GkGet.

Recommended practice questions in Computer Science · Search Algorithms

Which of the following territories was annexed by Lord Dalhousie under the pretext of misgovernance, and not directly through the Doctrine of Lapse?

What was the primary stated reason for the Partition of Bengal in 1905 by Lord Curzon?

Related Practice Questions