tags:

views:

11

answers:

0
+1  Q: 

Is it possible for breadth first search to have a larger operating time (O(n)) than IDDFS

I have an exam in an hour, and theres something in the lecture slides that I disagree with. Theres a nice little table saying that the time complexity of BFS is O(b^(d+1)), and the time complexity of IDDFS O(b^d), where b is a branching factor and d is the depth of the solution. I have no idea where he got the +1 for the BFS time complexity, and further more, implementation efficiency asside, with my understanding of IDDFS I have no idea why BFS would expand more nodes. Am I insane?

related questions

Best way to search data stored as XML in Sql Server?
What are the alternative's to using the iThenticate service for content comparison?
Search by hash?
Free text search integrated with code coverage
How-to: Ranking Search Results
Find item in WPF ComboBox
Find in Files: Search all code in Team Foundation Server
Searching for phone numbers in mysql
How do I implement Search Functionality in a website?
Can you perform an AND search of keywords using FREETEXT() on SQL Server 2005?
How do I search content, within audio files/streams?
Search Plugin for Safari
Search strategies in ORMs
Using Lucene to search for email addresses
SQL Server Full Text Searching
How do you do a case insensitive search using a pattern modifier using less ?
WildcardQuery error in Solr
PowerShell FINDSTR eqivalent?
Parsing search queries in Java
Need Pattern for dynamic search of multiple sql tables
grep a file, but show several surrounding lines?
Eclipse : Class file name must end with .class exception in Java Search
MOSS SSP problem - Failed database logons from deleted SSP
Incomplete results with Turkish characters in Indexing Service
Lucene Score results