I am studying informed search algorithms, and for Iterative Deepening A* Search, I know that the space complexity is O(d), where d is the depth of the shallowest goal node. I have tried to find out what its time complexity is, but I haven't been able to find any exact information about it on online resources. Is the exact time complexity of IDA* Search unknown? Any insights are appreciated.
Space complexity: O(d)
b: branching factor
You can find a proof and an example for the time complexity here.