Pre-requisite: Search Algorithms in
Informed Search: Informed Search algorithms have information on the goal state which helps in more efficient searching. This information is obtained by a function that estimates how close a state is to the goal state.
Example: Greedy Search and Graph Search
Uninformed Search: Uninformed search algorithms have no additional information on the goal node other than the one provided in the problem definition. The plans to reach the goal state from the start state differ only by the order and length of actions.
Examples: Depth First Search and Breadth-First Search
Informed Search vs. Uninformed Search:
|Informed Search||Uninformed Search|
|It uses knowledge for the searching process.||It doesn’t use knowledge for searching process.|
|It finds solution more quickly.||It finds solution slow as compared to informed search.|
|It is highly efficient.||It is mandatory efficient.|
|Cost is low.||Cost is high.|
|It consumes less time.||It consumes moderate time.|
|It provides the direction regarding the solution.||No suggestion is given regarding the solution in it.|
|It is less lengthy while implementation.||It is more lengthy while implementation.|
|Greedy Search, A* Search, Graph Search||Depth First Search, Breadth First Search|
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
- Difference between Vertical search and Horizontal search
- Difference between Organic Search and Paid Search
- Difference between Search Engine and Web Browser
- Difference Between Pay Per Click and Search Engine Optimization
- Meta Binary Search | One-Sided Binary Search
- Difference between Binary Tree and Binary Search Tree
- A* Search Algorithm
- Ternary Search
- Search Algorithms in AI
- Breadth First Search without using Queue
- Sentinel Linear Search
- Uniform Binary Search
- Complexity Analysis of Binary Search
- Selective Search for Object Detection | R-CNN
- ML | Monte Carlo Tree Search (MCTS)
- Search element in a Spirally sorted Matrix
- Number of comparisons in each direction for m queries in linear search
- Pre-Order Successor of all nodes in Binary Search Tree
- Uniform-Cost Search (Dijkstra for large Graphs)
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.