NIST

brute force

(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


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.

Entry modified 14 August 2008.
HTML page formatted Tue Dec 6 16:16:32 2011.

Cite this as:
Paul E. Black, "brute force", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 14 August 2008. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/bruteforce.html

to NIST home page