<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://gunkies.org/index.php?action=history&amp;feed=atom&amp;title=Algorithm</id>
	<title>Algorithm - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://gunkies.org/index.php?action=history&amp;feed=atom&amp;title=Algorithm"/>
	<link rel="alternate" type="text/html" href="https://gunkies.org/w/index.php?title=Algorithm&amp;action=history"/>
	<updated>2026-10-17T05:13:17Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.9</generator>
	<entry>
		<id>https://gunkies.org/w/index.php?title=Algorithm&amp;diff=35963&amp;oldid=prev</id>
		<title>Jnc: Fill this want</title>
		<link rel="alternate" type="text/html" href="https://gunkies.org/w/index.php?title=Algorithm&amp;diff=35963&amp;oldid=prev"/>
		<updated>2025-02-24T16:17:30Z</updated>

		<summary type="html">&lt;p&gt;Fill this want&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;An &amp;#039;&amp;#039;&amp;#039;algorithm&amp;#039;&amp;#039;&amp;#039; is a set of elementary steps, which, if followed precisely, will achieve a defined or desired goal. More advanced algorithms use [[conditional]] steps, included in that set, to divert [[execute|execution]] of the algorithm through various alternative paths through the set of steps.&lt;br /&gt;
&lt;br /&gt;
By contrast, guidance on a general approach to solving a particular class of problems (especially those that do not have a well-defined correct or optimal result) is called a &amp;#039;&amp;#039;&amp;#039;heuristic&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
&lt;br /&gt;
An approach to obtaining a result, which otherwise looks like an algorithm, but uses random data as one of its inputs, may or may not be an algorithm, depending on the exact formal definition of &amp;#039;algorithm&amp;#039; which is used. (The famous &amp;#039;Monte Carlo&amp;#039; heuristic, used in modeling complex systems, is an example.)&lt;br /&gt;
&lt;br /&gt;
All [[program]]s include (nay, &amp;#039;&amp;#039;instantiate&amp;#039;&amp;#039;) an algorithm. The &amp;#039;&amp;#039;concept&amp;#039;&amp;#039; of an algorithm, however, long pre-dates the invention of [[computing device]]s; the concept appeared in Medieval mathematics, and was later an obvious natural for use by such devices.&lt;br /&gt;
&lt;br /&gt;
The Persian scholar Muḥammad ibn Mūsā al-Khwārizmī wrote the first major work including the idea around 825 AD; by around 1230, the Latinization of his name, &amp;#039;Algorismi&amp;#039;, had come into use in the West to name such approaches. The name has remained, to honour him.&lt;br /&gt;
&lt;br /&gt;
[[Category: Basics]]&lt;/div&gt;</summary>
		<author><name>Jnc</name></author>
	</entry>
</feed>