Problem 604. Next lexicographic - permutation

Find next lexicographic - permutation (permutations as it would occur in a dictionary order).
E.g: nextP('ABCD') = ABDC
If you can generate the next permutation, then you can also generate a 'cycle' of all permutations using a construct like,
cycle = +1;
curr = start;
while ( true )
curr = nextP(curr);
if ( curr == start )
cycle = cycle+1;
For fun, you could generate all the n! permutations of a, unique n-letter string.

Solution Stats

42.95% Correct | 57.05% Incorrect
Last Solution submitted on Jul 21, 2023

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers49

Suggested Problems

More from this Author10

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!