Brute-force algorithm

A brute-force algorithm is a method of solving a problem by sequentially trying all possible solutions until a satisfactory one is found. This approach is used when there is no efficient algorithmic solution to a problem or when the size of the problem is small enough that the brute-force method is feasible.

For example, if you wanted to find the largest prime number less than 100, you could use a brute-force algorithm by starting at 99 and checking each number down to 2 until you find a prime number.

The disadvantage of a brute-force algorithm is that it can be very time-consuming and inefficient for large problems. For this reason, more efficient algorithms are often developed for specific types of problems. However, brute-force algorithms are still useful in many situations, especially when there is no other known solution or when the problem size is small enough to make the brute-force approach practical.