Let write some permutations of positive integers.
1: 1 2 3 4 5 6 ...
2: 2 1 3 4 ...
3: 1 3 2 4 ...
4: 2 3 1 4 ...
5: 3 1 2 4 ...
6: 3 2 1 4 ...
25: 1 2 3 5 4 ...
120: 5 4 3 2 1 6 7 ...Given an index, find appropriate permutation and truncate sorted part on the right side.
example:
323: 3 5 1 6 4 2 7 8 9 10 ...
>> n = 323;
>> whichperm(n)
ans =
3 5 1 6 4
See also: 42494
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers37
Suggested Problems
-
Project Euler: Problem 3, Largest prime factor
1821 Solvers
-
middleAsColumn: Return all but first and last element as a column vector
653 Solvers
-
Generate N equally spaced intervals between -L and L
955 Solvers
-
317 Solvers
-
Mersenne Primes vs. All Primes
855 Solvers
More from this Author40
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!