This article is about generating Power set in lexicographical order.
Input : abc Output : a ab abc ac b bc c
The idea is to sort array first. After sorting, one by one fix characters and recursively generates all subsets starting from them. After every recursive call, we remove last character so that next permutation can be generated.
a ab abc ac b bc c
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Print all permutations in sorted (lexicographic) order
- Generating distinct subsequences of a given string in lexicographic order
- Print a number as string of 'A' and 'B' in lexicographic order
- Find a string in lexicographic order which is in between given two strings
- Lexicographic rank of a string
- Lexicographic rank of a string using STL
- Lexicographic smallest permutation of a String containing the second String as a Substring
- Lexicographic rank of a string among all its substrings
- Find the N-th lexicographic permutation of string using Factoradic method
- Lexicographic rank of a string with duplicate characters
- Print nodes of a Binary Search Tree in Top Level Order and Reversed Bottom Level Order alternately
- Recursive program to generate power set
- Highest power of 2 less than or equal to given number
- Find ways an Integer can be expressed as sum of n-th power of unique natural numbers
- Breaking a number such that first part is integral division of second by a power of 10
- Compute the maximum power with a given condition
- Find sub-string with given power
- Given two numbers as strings, find if one is a power of other
- Minimum splits in a binary string such that every substring is a power of 4 or 6.
- Maximum power of jump required to reach the end of string
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.