Brute force algorithm goes through all possible solutions extensively.
A brute-force approach for the eight queens puzzle would examine all possible arrangements of 8 pieces on the 64-square chessboard, and, for each arrangement, check whether each (queen) piece can attack any other. A brute-force attack in cryptography involves systematically checking all possible keys until the correct key is found.
|238 Finding the best path for a travelling salesman || Travelling salesman problem solve to find the shortest possible route that visits each city exactly once and returns to the origin city. |
|239 linear search || Linear search is a method to find particular item in an array. It start to check each item and compare with search item until it finds. The linear search perform non sorted items in array |