Sequential or selective access to N Permute K

I found the function below on File Exchange developed by Loginatorist, which creates a matrix of permutations of elements with replacement. The problem with this function and similar official MATLAB functions that generate a matrix of all possible combinations (such as combnk) is that the output matrix quickly breaches the memory limits.

I would be interested in learning if anyone has developed code that can achieve the same effect, but without actually generating the large matrix. Instead, each row of such a final matrix should be computable simply by specifying the row number. Then, if one wanted all entries, one could simply look through each row.

Perhaps someone has a good idea about how to achieve this in the setting of the function below:

EDIT by Stephen Cobeldick: the function is copyright by Matt Fig, but is available here:

https://www.mathworks.com/matlabcentral/fileexchange/11462-n-permute-k

Answer 1

[Stephen23]

Have a look at these:

https://www.mathworks.com/matlabcentral/fileexchange/13101-recperms--recursive-permutations-

http://www.mathworks.com/matlabcentral/fileexchange/57429-nextperm

http://www.mathworks.com/matlabcentral/fileexchange/22692-nextperm