Update backtracking/subset_sum.cpp

Swastyy · mishraabhinn · web-flow · commit 1b82d4991b28 · 2021-07-06T09:12:21.000+05:30
Co-authored-by: Abhinn Mishra &lt;49574460+mishraabhinn@users.noreply.github.com&gt;
diff --git a/backtracking/subset_sum.cpp b/backtracking/subset_sum.cpp
@@ -1,7 +1,6 @@
 /**
  * @file
- * @brief Program to Count number of subsets (non-continuous
- * subarrays) with a given sum
+ * @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. 
  *
  * @details Subset problem (https://en.wikipedia.org/wiki/Subset_sum_problem)
  * @author [Swastika Gupta](https://github.com/swastyy)

Original file line number	Diff line number	Diff line change
`@@ -1,7 +1,6 @@`
`1`	`1`	`/**`
`2`	`2`	`* @file`
`3`		`- * @brief Program to Count number of subsets (non-continuous`
`4`		`- * subarrays) with a given sum`
	`3`	`+ * @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.`
`5`	`4`	`*`
`6`	`5`	`* @details Subset problem (https://en.wikipedia.org/wiki/Subset_sum_problem)`
`7`	`6`	`* @author [Swastika Gupta](https://github.com/swastyy)`