
Ray J. Chen
Flexibel FullStack Solution Programmer or Data Engineer
The abstract (first page) of the accepted software
• R. J. Chen, K. S. Reschke and H. Hu, "Design and Analysis of a TreeBacktracking Algorithm for Multiset and Pure Permutations ," International Workshop on Combinatorial Algorithms ( IWOCA 2012 ), Kalasalingam University, India, LNCS 7643, pp. 288292 , July 1921, 2012. Our open source soltion code
Design and Analysis of a TreeBacktracking Algorithm for Multiset and Pure Permutations
Ray Jinzhu Chen^{1}, Kevin Scott Reschke^{2}, Hailong Hu^{3}
^{1} Endign, Dublin, OH USA
rchen@dataverify.com
^{2}Department of Computer Science, Stanford University, Stanford, CA, USA
^{3}Software School, Xiamen University, Xiamen, China
Abstract. A treebacktrackingbased technique, permutation tree generation with Anterioritemsinanarray for Remaining Distinct Elements (ARDE), is introduced for multiset and pure permutations. We analyze the algorithm at the assembly level and obtain its time formula for pure permutations. We mathematically prove that our time formula is 11.5% faster than the corresponding formula of the previous fastest algorithm for pure permutations for any length N > 3. We also offer related source codes and executable files on our website for others to use.
