use recursion to generate random permutations
1 次查看(过去 30 天)
显示 更早的评论
a) Write a recursive algorithm that takes as input a set of elements and an integer l, and returns all their permutations of length l.
b) Adjust the previous algorithm to return a random subset of all the permutations containing n elements.
Hint: generating all the permutations and selecting n of them afterwards in not a good idea.
a) and b) are two codes.I really don't know how to write the code. Any help will be appreciated! Thanks a lot!
0 个评论
回答(1 个)
另请参阅
类别
在 Help Center 和 File Exchange 中查找有关 Discrete Math 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!