mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-02-13 07:25:42 +08:00
Update backtracking/subset_sum.cpp
Co-authored-by: Abhinn Mishra <49574460+mishraabhinn@users.noreply.github.com>
This commit is contained in:
@@ -1,7 +1,6 @@
|
|||||||
/**
|
/**
|
||||||
* @file
|
* @file
|
||||||
* @brief Program to Count number of subsets (non-continuous
|
* @brief We are given with an array and a sum value. The algorithms find all the subsets of that array with sum equal to given sum and return such subsets count. This approach will have exponential time complexity.
|
||||||
* subarrays) with a given sum
|
|
||||||
*
|
*
|
||||||
* @details Subset problem (https://en.wikipedia.org/wiki/Subset_sum_problem)
|
* @details Subset problem (https://en.wikipedia.org/wiki/Subset_sum_problem)
|
||||||
* @author [Swastika Gupta](https://github.com/swastyy)
|
* @author [Swastika Gupta](https://github.com/swastyy)
|
||||||
|
|||||||
Reference in New Issue
Block a user