Problem 604. Next lexicographic - permutation

Created by Muthu Annamalai
Appears in Combinatorics I

Difficulty:Rate

Solve Later
Add To GroupÃ‚

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 )
             break;
         end
         cycle = cycle+1;
     end
For fun, you could generate all the n! permutations of a, unique n-letter string.

Solve

Solution Stats

156 Solutions
49 Solvers

Last Solution submitted on Jul 21, 2023

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

Stefan Abendroth on 20 Jul 2023

I think test case 6 is wrong. The lexicographic follower of 'xyzDOG' is 'xyzGDO', not 'xyzGOD'.

Dyuman Joshi on 21 Jul 2023

@Stefan, if you see carefully, test case 6 asks for the *next to next* lexicographic permutation of 'DOG', which is 'GOD'.

Solution Comments

Show comments

Group

Combinatorics I

15 Problems
28 Finishers

Problem Recent Solvers49

Problem Tags

Community Treasure Hunt

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

Start Hunting!