Sequential or selective access to N Permute K
1 visualizzazione (ultimi 30 giorni)
Mostra commenti meno recenti
Ulrik William Nash
il 17 Lug 2017
Modificato: Stephen23
il 17 Lug 2017
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:
0 Commenti
Risposta accettata
Più risposte (0)
Vedere anche
Categorie
Scopri di più su Matrices and Arrays in Help Center e File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!