Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!bally!siva
From: siva@bally.Bally.COM (Siva Chelliah)
Newsgroups: comp.misc
Subject: permutation
Keywords: permutation, parallel
Message-ID: <377@bally.Bally.COM>
Date: 22 Sep 90 00:13:27 GMT
Organization: Bally Mfg. - Reno, Nevada
Lines: 15


Subject: permutation
Newsgroups: comp.parallel
Keywords: permutation, parallel


Has anyone done any work on parallel algorithm to find all permutations of a 
string?  I have an idea that uses unix's fork() function, but have not
coded yet.  I just want to find out if anybody has done any timing analysis
on this problem. 

The problem is : given a string (say "cat") find all the permutions of it
The ans        : cat, cta, atc, act, tac, tca

Thanks in advance.