(algorithmic technique)
Definition: An algorithm that inefficiently solves a problem, often by trying every one of a wide range of possible solutions.
Specialization (... is a kind of me.)
exhaustive search, brute force string search.
Note: After LK.
From Dragon Tails. Used by permission. Copyright © 2003 Tim Dawson.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 2 December 2013.
HTML page formatted Mon Feb 2 13:10:39 2015.
Cite this as:
Paul E. Black, "brute force", in
Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 2 December 2013. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/bruteforce.html