Hi,

I need to print out all possible permutable outcomes for a alpha-numeric string. For example "123" should produce "123", "132","213","231","321","312". The number of outcomes can be dertermined by factorial of numbers of characters in the string, i.e. nx(n-1)x(n-2)x...x2x1. My problem is to work out the algorithm to do this. Can someone out there help.

TIA,
juan