(algorithmic technique)
Definition: An algorithm that finds a solution by trying every possibility.
See also brute force, search.
Author: BB
All the Needles in a Haystack: Can Exhaustive Search Overcome Combinatorial Chaos?
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 25 July 2022.
HTML page formatted Mon Jul 25 09:56:30 2022.
Cite this as:
Bob Bockholt, "exhaustive search", in
Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 25 July 2022. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/exhaustiveSearch.html