Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Create GenerateSubsets #1581

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

Open
imshreya2000 wants to merge 3 commits into TheAlgorithms:master
base: master
Choose a base branch
Loading
from imshreya2000:patch-3

Conversation

Copy link

@imshreya2000 imshreya2000 commented Oct 26, 2023

Open in Gitpod know more

Describe your change:

  • Add an algorithm?
  • Fix a bug or typo in an existing algorithm?
  • Documentation change?

Checklist:

  • I have read CONTRIBUTING.md.
  • This pull request is all my own work -- I have not plagiarized.
  • I know that pull requests will not be merged if they fail the automated tests.
  • This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
  • All new JavaScript files are placed inside an existing directory.
  • All filenames should use the UpperCamelCase (PascalCase) style. There should be no spaces in filenames.
    Example:UserProfile.js is allowed but userprofile.js,Userprofile.js,user-Profile.js,userProfile.js are not
  • All new algorithms have a URL in their comments that points to Wikipedia or another similar explanation.
  • If this pull request resolves one or more open issues then the commit message contains Fixes: #{$ISSUE_NO}.

SamyMEDDAD reacted with heart emoji
Copy link
Member

@imshreya2000 pls add tests and some documentation

Copy link
Author

@CarlosZoft I have added the test and explanation. Kindly review.

Copy link
Collaborator

@appgurueu appgurueu left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I think the files should be placed in Recursive/GenerateSubsets.js and Recursive/tests/GenerateSubsets.test.js respectively.

@@ -0,0 +1,26 @@
function generateSubsets(nums) {
Copy link
Collaborator

@appgurueu appgurueu Oct 29, 2023

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

  1. Call the parameter arr, not nums. The implementation doesn't need to make any assumptions about the values in arr.
  2. This should have a doc comment stating what this does (builds and returns a list of all subsets in lexicographic order). Also, consider using a generator rather than building a list; sometimes you want to iterate over all subsets without storing them all temporarily in memory (for example when solving hard optimization problems).

function generateSubsets(nums) {
const subsets = [];

function backtrack(start = 0, currentSubset = []) {
Copy link
Collaborator

@appgurueu appgurueu Oct 29, 2023

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I'm not sure I would call this backtracking; to me it's just ordinary recursion:

Backtracking is a class of algorithms for finding solutions to some computational problems, notably constraint satisfaction problems, that incrementally builds candidates to the solutions, and abandons a candidate as soon as it determines that the candidate cannot possibly be completed to a valid solution.

return subsets;
}

const inputSet = [1, 2, 3];
Copy link
Collaborator

@appgurueu appgurueu Oct 29, 2023
edited
Loading

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

This example should be removed from this file (or converted into a JSDoc example).

@@ -0,0 +1,24 @@
// we define a generateSubsets function that uses backtracking to generate all possible subsets of a given set (array of numbers). The backtrack function is a recursive function that explores all possible subsets by considering or excluding each element.
Copy link
Collaborator

@appgurueu appgurueu Oct 29, 2023

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

That's in the other file. Remove this comment from the test file.

Copy link
Member

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers

@appgurueu appgurueu appgurueu requested changes

@raklaptudirm raklaptudirm Awaiting requested review from raklaptudirm raklaptudirm is a code owner

Requested changes must be addressed to merge this pull request.

Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.

AltStyle によって変換されたページ (->オリジナル) /