On Fri, 2005-04-22 at 12:36 +0900, Endy Tjahjono wrote:
> Hello all,
> 
> I have just created a function that returns all letter permutation in
> a word, so if I put 'abc', it will return 'abc', 'acb', 'bac', 'bca',
> 'cab', 'cba'.

You can use a suffix array to do this without recursion.  See
http://www.cs.dartmouth.edu/~doug/sarray/ for an explanation.

I use a suffix array structure in fastcst but I haven't broken it out
yet.  If you want to play with it, then contact me offline and I'll help
you get it configured.

zed