(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 E. Black.
Entry modified Thu Dec 16 08:57:09 2004.
HTML page formatted Wed Oct 26 09:47:17 2005.
Cite this as:
Paul E. Black, "brute force", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/bruteforce.html
