Brute force is one of the 8 implementation of algorithms used in Algorithms and Analysis course, It basically creates the possible solutions for each problem, we can say this method finds all possible solutions for given problem ans then it sort the best one.

Ex: distance be nodes find shortest distance between two nodes if there are five or more nodes it calculates distance between all neighboring nodes and results the best one.

If time complexity is not a constraint this method is best, Its basic idea is to find out the best.