Implementing Heap Algorithm of Permutation in JavaScript

Let us assume that there are r boxes and each of them can hold one thing. There will be as many permutations as there are ways of filling in r vacant boxes by n objects. No. of ways first box can be filled: n No.