https://wiki.sarg.dev/index.php?action=history&feed=atom&title=British_Museum_algorithmBritish Museum algorithm - Revision history2026-08-01T18:39:11ZRevision history for this page on the wikiMediaWiki 1.44.2https://wiki.sarg.dev/index.php?title=British_Museum_algorithm&diff=548394&oldid=prev~2025-31680-88: There is no proof they said this and the source doesn't tell us anything about british museum sort2025-11-06T09:56:03Z<p>There is no proof they said this and the source doesn't tell us anything about british museum sort</p>
<p><b>New page</b></p><div>{{Use dmy dates|date=August 2015}}<br />
{{Use British English|date=August 2015}}<br />
<br />
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.<br />
<br />
== See also == <br />
* [[Bogosort]]<br />
* [[Branch and bound]]<br />
* [[Breadth-first search]] <br />
* [[Brute-force search]]<br />
<br />
== Sources ==<br />
{{DADS|British Museum technique|britishMuseum}}.<br />
<br />
==References==<br />
{{Reflist}}<br />
<br />
[[Category:Algorithms]]<br />
[[Category:British Museum|Algorithm]]</div>~2025-31680-88