# British Museum algorithm

> Mediated Wiki article. Canonical URL: https://mediated.wiki/source/British_Museum_algorithm
> Markdown URL: https://mediated.wiki/source/British_Museum_algorithm.md
> Source: https://en.wikipedia.org/wiki/British_Museum_algorithm
> Source revision: 1320718449
> License: Creative Commons Attribution-ShareAlike 4.0 International (https://creativecommons.org/licenses/by-sa/4.0/)

{{Use dmy dates|date=August 2015}}
{{Use British English|date=August 2015}}

The '''British Museum algorithm''' is a general approach to finding a solution by checking all possibilities one by one, beginning with the smallest. The term refers to a conceptual, not a practical, technique where the number of possibilities is enormous.

== See also == 
* [Bogosort](/source/Bogosort)
* [Branch and bound](/source/Branch_and_bound)
* [Breadth-first search](/source/Breadth-first_search) 
* [Brute-force search](/source/Brute-force_search)

== Sources ==
{{DADS|British Museum technique|britishMuseum}}.

==References==
{{Reflist}}

Category:Algorithms
Algorithm

---
Adapted from the Wikipedia article [British Museum algorithm](https://en.wikipedia.org/wiki/British_Museum_algorithm) by Wikipedia contributors ([contributor history](https://en.wikipedia.org/wiki/British_Museum_algorithm?action=history)). Available under [Creative Commons Attribution-ShareAlike 4.0 International](https://creativecommons.org/licenses/by-sa/4.0/). Changes may have been made.