OpenGenus/cosmos

Partitions of a set with backtracking

Open

#743 opened on Oct 6, 2017

View on GitHubContributor guide
 (3 comments) (1 reaction) (0 assignees)C++ (3,724 forks)batch import
Hacktoberfestadd codenew algorithm

Repository metrics

Stars
 (13,462 stars)
PR merge metrics
 (No merged PRs in 30d)

Description

I will implement a generator for all the partitions of a set using backtracking. Would that be ok?

Contributor guide

Research direction
Implement a recursive backtracking algorithm to generate all partitions of a set. Represent the set as a vector of elements. Use a vector of vectors to store the current partition. At each step, choose an element and either place it in an existing subset or create a new subset. Recurse until all elements are placed. Collect all valid partitions.
Tech stack
cpp
Domain
backend
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
2
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
Half day
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Active
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
C++
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
60