Uninformed search:-
It is called as brute-force or "blind" search. Uninformed Searched uses no knowledge about the problem, hence possibly less efficient than an informed search.
Examples of uninformed search algorithm:-
Breadth-first search and Depth-first search, Depth-limited search, Uniform-cost search, Depth-first iterative deepening search and bidirectional search.
Informed search:-
It is also called "heuristic search", it uses prior knowledge or "domain knowledge" about the problem, hence possibly more efficient than uninformed search.
Examples of informed search algorithm:-
Best-first search and A*.