Search snippets
Browse Code Answers
FAQ
Usage docs
Log In
Sign Up
Home
Whatever
Which search is complete and optimal when h(n) is consistent?
Shruti Paliwal
Programming language:
Whatever
2021-06-23 00:15:31
0
Q:
Which search is complete and optimal when h(n) is consistent?
user59057
Code:
Whatever
2021-07-24 23:38:35
A* using graph-search is optimal
0
Tags
con
search
when
Related
Given a integer h, find the possible number of balanced binary trees of height h.
find duplicate in an array using xor
How would you optimally calculate p^k, where k is a non-negative integer? What is the complexity of the solution?
how many stacks are required for evaluation of prefix expression
Which of the following data structure can’t store the non homogeneous data elements?
check if bfs is possible or not
find the graph is minimal spanig tree or not
Given a square matrix list[ ] [ ] of order 'n'. The maximum value possible for 'n' is 20.
Which is more preferred for smoothening the image - averaging filter or median filter?
New to Communities?
Join the community