<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="http://www.bytemycode.com/rssformat.xsl"?><rss version="2.0" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/">
	<channel>
		<title>byteMyCode: Snippet Revisions</title>
		<link>http://www.bytemycode.com</link>
		<description>Revisions for this snippet.</description>
		<pubDate>Sat, 22 Nov 2008 09:21:00 +0000</pubDate>
		<copyright>1998-2008 </copyright>
		<language>en-us</language>
		<image>
		      <link>http://www.bytemycode.com</link>
		      <url>http://www.bytemycode.com/img/rss_title.gif</url>
		      <title>byteMyCode</title>
		</image>

	
	<item>
		<title>Generate all permutations of a list 1</title>
		<link>http://www.bytemycode.com/snippets/snippet/459/1/</link>
		<comments>http://www.bytemycode.com/snippets/snippet/459/comments/</comments>
		<pubDate>Wed, 11 Oct 2006 14:41:21 +0000</pubDate>
		<dc:creator>nil_ptr</dc:creator>
		<category>permutations, permute, python</category>
		<guid isPermaLink="false">http://www.bytemycode.com/snippets/snippet/459/</guid>
		<description>
			<![CDATA[
				<p>This is snippet of code solves the interesting (and specialized) problem of generating all permutations of a list.  I hope you like recursion. <img src="http://www.bytemycode.com/img/wysiwyg/emo-smile.gif" />  For exmaple:<br /><br />permute( [0,1,2] )<br /><br />would return<br /><br />[[0,1,2],[0,2,1],[1,0,2],[1,2,0],[2,0,1],[2,1,0]]</p>
			]]>
		</description>
	</item>

	
	</channel>
</rss>