The British Museum algorithm is a general, deliberately impractical approach to solving a problem by checking every possible solution one by one, starting with the smallest, until the answer is found. It is used in computer science as a conceptual baseline for brute-force search, illustrating what an exhaustive search looks like and giving a point of comparison for judging how much better a genuinely practical algorithm is when the space of possibilities is too large to check exhaustively. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Classification
Design Technique Sources
1. Wikipedia: British Museum algorithm
entity record, description (design-technique)Quote, entity record, description (design-technique)
It is used in computer science as a conceptual baseline for brute-force search, illustrating what an exhaustive search looks like and giving a point of comparison for judging how much better a genuinely practical algorithm is when the space of possibilities is too large to check exhaustively.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.