Exhaustive search, also known as brute force search, is an algorithmic approach that systematically explores all possible solutions to find the best one, often at the cost of high computational resources. It is most effective for small problem spaces where the cost of computation is manageable, but becomes impractical for larger spaces due to exponential growth in possibilities.