- if the order does not matter: combinations.
- if the order is important: permutations.
how to generate all possible combination from a sequence
조회 수: 3 (최근 30일)
이전 댓글 표시
how to generate all possible combination from a n-dimensional vector without repetition of numbers.. i wanted combination of vec = 1:11;
eg:
vec = [1 2 3]
result = [
1 2 3;
1 3 2;
2 3 1;
2 1 3;
3 2 1;
3 1 2];
댓글 수: 1
Stephen23
2016년 5월 28일
편집: Stephen23
2016년 5월 28일
Your question is erroneous: these are not the combinations of vec, but are actually the permutations.
The difference is very simple:
You should make a complaint to your high school that they did not teach these basic mathematical terms correctly. Ask for your money back!
채택된 답변
Stephen23
2016년 5월 28일
>> perms(1:3)
ans =
3 2 1
3 1 2
2 3 1
2 1 3
1 2 3
1 3 2
댓글 수: 5
Stephen23
2016년 5월 30일
편집: Stephen23
2016년 5월 30일
@Elysi Cochin: essentially you have two choices:
- buy more memory for your computer.
- change your algorithm.
As the other commenters have already told you, even though beginners often imagine that their computer has never-ending memory and processing capabilities, in practice it is very simple to define a few commands that far exceed any computer's abilities.
Your task (as the author of your algorithm) is to understand this and to get information on alternatives. One possibility is to use a permutation generator that generates each permutation at a time (not all at once). This will be slow, but it will avoid the memory problems. You will find several submissions on FEX that provide this functionality:
Ultimately however, you will just find that this takes too long, and you will then have to consider alternatives to your algorithm. Good luck!
추가 답변 (1개)
참고 항목
카테고리
Help Center 및 File Exchange에서 Performance and Memory에 대해 자세히 알아보기
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!