Find All Permutations of any number in JavaScript.

Question: 

Given a string S of length N. 

Print all permutations of the string in separate lines.

Input Size: 1 <= N <= 100000

Sample Testcases :

INPUT:
123

OUTPUT:
123
231
321
213
312
132

Answer: 

Steps to find all permutations of any number:

1. We are going to use Recursion for calculating the permutations. Create a method called "getPermutations", and create a Permutations array inside the method that will hold all the permutations. Let's start with the base condition (Where the recursion stops).
2. The base condition will be when the number has only one digit simply add it to the permutations array and return the array.
3. If the number has more digits, then iterate through all the digits.
4. On each iteration, find the current digit (store it in one variable) and find all other digits (store it in another variable).
5. Call the recursive function "getPermutations" and pass the other digits variable created in the above step. We will expect this to return an array of all permutations of the other digits variable.
6. For each permutation received, append to the current digit and add it to the Permutations array.
7. Since we are iterating the actual number, this will be done for all digits.
8. Outside the for loop simply return the Permutations array.