algorithm - What is complete search method in solving problems?

Question

I am reading Competitive Programmer’s Handbook. In chapter 5 it explains about complete search method and compares it with Greedy and Dynamic methods to solve problems:

Complete search is a general method that can be used to solve almost any algorithm problem. The idea is to generate all possible solutions to the problem using brute force, and then select the best solution or count the number of solutions, depending on the problem. Complete search is a good technique if there is enough time to go through all the solutions, because the search is usually easy to implement and it always gives the correct answer. If complete search is too slow, other techniques, such as greedy algorithms or dynamic programming, may be needed.

I need an explanation on what it is and could you introduce me a resource about it?

question from:https://stackoverflow.com/questions/65641427/what-is-complete-search-method-in-solving-problems

Answer 1

Waitting for answers