<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://www.conservapedia.com/index.php?action=history&amp;feed=atom&amp;title=Collective_recursion</id>
	<title>Collective recursion - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://www.conservapedia.com/index.php?action=history&amp;feed=atom&amp;title=Collective_recursion"/>
	<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Collective_recursion&amp;action=history"/>
	<updated>2026-10-21T15:16:45Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.35.14</generator>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Collective_recursion&amp;diff=418844&amp;oldid=prev</id>
		<title>EdBot: Category:Computer Science</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Collective_recursion&amp;diff=418844&amp;oldid=prev"/>
		<updated>2008-04-01T21:28:51Z</updated>

		<summary type="html">&lt;p&gt;&lt;a href=&quot;/Category:Computer_Science&quot; title=&quot;Category:Computer Science&quot;&gt;Category:Computer Science&lt;/a&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left diff-editfont-monospace&quot; data-mw=&quot;interface&quot;&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;tr class=&quot;diff-title&quot; lang=&quot;en&quot;&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;Revision as of 21:28, April 1, 2008&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l3&quot; &gt;Line 3:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 3:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;One can optimize this type of [[recursion]] by executing the call in the current stack frame, rather than creating a new stack frame.  Another way to optimize this type of [[recursion]] is by deallocating the entire recursion stack at once rather than a little at each return.&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;One can optimize this type of [[recursion]] by executing the call in the current stack frame, rather than creating a new stack frame.  Another way to optimize this type of [[recursion]] is by deallocating the entire recursion stack at once rather than a little at each return.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;[[&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;category&lt;/del&gt;:&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;computer science&lt;/del&gt;]]&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;[[&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;Category&lt;/ins&gt;:&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;Computer Science&lt;/ins&gt;]]&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>EdBot</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Collective_recursion&amp;diff=303262&amp;oldid=prev</id>
		<title>Aschlafly: New page: '''Collective recursion''' is a special type of tail recursion, having results  produced during the recursive calls with nothing returned.   One can optimize this type of recursion...</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Collective_recursion&amp;diff=303262&amp;oldid=prev"/>
		<updated>2007-09-29T23:07:04Z</updated>

		<summary type="html">&lt;p&gt;New page: &amp;#039;&amp;#039;&amp;#039;Collective recursion&amp;#039;&amp;#039;&amp;#039; is a special type of &lt;a href=&quot;/Tail_recursion&quot; title=&quot;Tail recursion&quot;&gt;tail recursion&lt;/a&gt;, having results  produced during the recursive calls with nothing returned.   One can optimize this type of &lt;a href=&quot;/Recursion&quot; title=&quot;Recursion&quot;&gt;recursion&lt;/a&gt;...&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;'''Collective recursion''' is a special type of [[tail recursion]], having results  produced during the recursive calls with nothing returned. &lt;br /&gt;
&lt;br /&gt;
One can optimize this type of [[recursion]] by executing the call in the current stack frame, rather than creating a new stack frame.  Another way to optimize this type of [[recursion]] is by deallocating the entire recursion stack at once rather than a little at each return.&lt;br /&gt;
&lt;br /&gt;
[[category:computer science]]&lt;/div&gt;</summary>
		<author><name>Aschlafly</name></author>
	</entry>
</feed>