AI: Uninformed Search Complexities
0.0(0)
Studied by 0 people
Learn
Practice Test
Spaced Repetition
Match
FlashcardsCard Sorting
1/3
Earn XP
Description and Tags
Study Analytics
Name | Mastery | Learn | Test | Matching | Spaced |
|---|
No study sessions yet.
4 Terms
1
New cards
BFS Time Complexity
O(bd) where b is the maximum branching factor and d is the depth of the least-cost solution
2
New cards
BFS Space Complexity
O(bd) as every node is stored
3
New cards
DFS Time Complexity
O(bm) where b is the maximum branching factor and m is the maximum depth
4
New cards
DFS Space Complexity
O(bm)
Note 
Flashcards (103)