Brute force is a straightforward approach to problem solving, usually directly based on the problem’s statement and definitions of the concepts involved.Though rarely a source of clever or efficient algorithms,the brute-force approach should not be overlooked as an important algorithm design strategy. Unlike some of the other strategies, brute force is applicable to a very wide variety of problems.

For some important problems ( sorting, searching, string matching), the brute-force approach yields reasonable algorithms of at least some practical value with no limitation on instance size

Even if too inefficient in general, a brute-force algorithm can still be useful for solving small-size instances of a problem. A brute-force algorithm can serve an important theoretical or educational purpose.