Clarification on time complexity from graphs search section
0 Answers
Clarification on time complexity from graphs search section
| Flag | PURGE
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.
Email me when people comment.
Email me when people comment.
Loading...
An error occurred in subscribing you.
Email me when people comment.
Email me when people comment.
Loading...
An error occurred in subscribing you.
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.