Which is the worst - case time complexity of uniform cost search?

Let C* is Cost of the optimal solution, and ε is each step to get closer to the goal node. Then the number of steps is = C*/ε+1. Here we have taken +1, as we start from state 0 and end to C*/ε. Hence, the worst-case time complexity of Uniform-cost search is O (b1 + [C*/ε])/.
For More Information Please Refer:


You May Also Like to Read: