Answer:
The algorithm that tries every possible solution is known as Exhaustive Search. Also known as the Brute Force or British Museum algorithm.
Explanation:
Exhaustive search is an appealing algorithm-design technique that is widely applicable to search-oriented problems. It always proves correct, given correct generation and checking.
I hope this helps.
