Clarification on time complexity from graphs search section
In the book it's stated "Recall that (k^d / 2 ) *(k^d / 2 ) = kd" - page 109, 6th edition, explaining why bidirectional search is faster than breadth-first search.
I can't recall where this comes from.....I mean, trying to factor them using standard math/polynomial calculations it doesn't result in this.
Any help on this (probably very silly) question is appreciated.
Open Chat in New Window