Lexicographically next permutation in C++

Here we will see how to generate lexicographically next permutation of a string in C++. The lexicographically next permutation is basically the greater permutation. For example, the next of “ACB” will be “BAC”. In some cases, the lexicographically next permutation is not present, like “BBB” or “DCBA” etc.

In C++ we can do it by using a library function called next_permutation(). This is present in the algorithm header file.

Example

#include <iostream>
#include <algorithm>
using namespace std;
main() {
   string s = "DBAC";
   for(int i = 0; i<5; i++) {
      bool val = next_permutation(s.begin(), s.end());
      if (val == false) {
         cout << "No next permutation" << endl;
         break;
      } else
      cout << "Next: " << s << endl;
   }
}

Output

Next: DBCA
Next: DCAB
Next: DCBA
No next permutation

Smita Kapse

Updated on 30-Jul-2019 22:30:26

• Related Questions & Answers
• Next Permutation in Python
• Find n-th lexicographically permutation of a strings in Python
• Find n-th lexicographically permutation of a strings in C++
• Program to get next integer permutation of a number in C++
• Program to check is there any permutation that is lexicographically bigger or not between two strings in Python
• Find a string such that every character is lexicographically greater than its immediate next character in Python
• Lexicographically minimum string rotation
• Permutation Sequence in C++
• Find Permutation in C++
• Comparing two Strings lexicographically in Java
• Compare two strings lexicographically in C#
• Compare two strings lexicographically in Java.
• Lexicographically Smallest Equivalent String in C++
• Permutation in String in C++
• Permutation and Combination in Java