It is the maximum storage or memory taken by the algorithm at any time while searching.Īlso used to compare the efficiency of the different types of searching algorithms. ![]() If the algorithm completes a task in a lesser amount of time, then it is an efficient one. The time taken by an algorithm to complete its task is called time complexity. If a solution found is best (lowest path cost) among all the solutions identified, then that solution is said to be an optimal one. Properties of search algorithms CompletenessĪ search algorithm is said to be complete when it gives a solution or returns any solution for a given random input. Let’s discuss some of the essential properties of search algorithms. The process of problem-solving using searching consists of the following steps. In general, searching is referred to as finding information one needs. In this article, I am going to discuss the various searching techniques that are used to solve a problem. In artificial intelligence, problems can be solved by using searching algorithms, evolutionary computations, knowledge representations, etc.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |