Recent

• Simple Particle Engine for a shooter game
• Snake / Nibbles clone in C and Ncurses
• Please improve
• Parsing of XML data has high CPU usage
• Convert simple Javascript to jQuery plugin
• Active Record getting unique records
• List the files in a directory without the directory name or the extension
• clean the code
• ohs system, recruitment software, hr software, oh&s software, human resources software, ohs software
• Array parsing in a block

Popular

• Parsing of XML data has high CPU usage
• Snake / Nibbles clone in C and Ncurses
• Please improve
• List the files in a directory without the directory name or the extension
• Convert simple Javascript to jQuery plugin
• Active Record getting unique records
• Simple Particle Engine for a shooter game
• Breadth first cartesian product iterator
• php refactoring
• first BST

Pastable version of Computing permutations with a recursive generator expression

<pre class='prettyprint' language='python'>#!/usr/bin/python2.5 def permute(li): &quot;&quot;&quot;Generate all permutations of a sequence &gt;&gt;&gt; for i in permute([1,2,3]): print i (1, 2, 3) (1, 3, 2) (2, 1, 3) (2, 3, 1) (3, 1, 2) (3, 2, 1)&quot;&quot;&quot; return ((i,)+j for i in li for j in (permute([k for k in li if k is not i]) if len(li) &gt; 1 else [()] ) ) import doctest doctest.testmod(verbose=True)</pre> <a href="http://www.refactormycode.com/codes/551-computing-permutations-with-a-recursive-generator-expression" style="color:#fff" title="As seen on RefactorMyCode.com"><img alt="Small_logo" src="http://www.refactormycode.com/images/small_logo.gif" style="border:0" /></a>