New answers tagged

0 votes

Time complexity of BFS in O(b^n) - Constant of Big-O-Notation?

Since the LHS of your first inequality only has a finite $(d+1)$ terms and $b,d$ are integers greater than $1$ in breadth-first search, your $k$ could be simply set as $(d+1)$ or anything greater to ...
cinch's user avatar
  • 2,307

Top 50 recent answers are included