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 Black.

Entry modified 2 December 2013.
HTML page formatted Wed Mar 13 12:42:45 2019.

Cite this as:
Paul E. Black, "brute force", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 2 December 2013. (accessed TODAY) Available from: