Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[NEW ALGORITHM] Implement Power Set in Lexicographic order #1154

Closed
2 tasks done
Sayantan1024 opened this issue Oct 22, 2024 · 2 comments
Closed
2 tasks done

[NEW ALGORITHM] Implement Power Set in Lexicographic order #1154

Sayantan1024 opened this issue Oct 22, 2024 · 2 comments

Comments

@Sayantan1024
Copy link
Contributor

Issue will be closed if:

  1. You mention more than one algorithm. You can create a separate issue for each algorithm once the current one is completed.
  2. You propose an algorithm that is already present or has been mentioned in a previous issue.
  3. You create a new issue without completing your previous issue.

Note: These actions will be taken seriously. Failure to follow the guidelines may result in the immediate closure of your issue.


Name:

Power Set in Lexicographic order under Backtracking algorithms.

About:

Propose a algorithm "Power Set in Lexicographic order" to be added to this repository. A power set is the set of all subsets of a given set, including the set itself and the empty set. The idea is to recursively generate all the subsets by fixing each character, after sorting the array first.


Labels:

new algorithm, gssoc-ext, hacktoberfest, level1


Assignees:

  • Contributor in GSSoC-ext
  • Want to work on it
Copy link

👋 Thank you for raising an issue! We appreciate your effort in helping us improve. Our team will review it shortly. Stay tuned!

@pankaj-bind
Copy link
Collaborator

@Sayantan1024 assigned

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

2 participants