From bfba874f1a05f72526c0d28cffb3fb0cae910f53 Mon Sep 17 00:00:00 2001
From: mann01 <mann01.jain@gmail.com>
Date: Thu, 17 Oct 2019 06:32:30 -0700
Subject: [PATCH] MYFirst

---
 all_subsets.cpp | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/all_subsets.cpp b/all_subsets.cpp
index 82cd2c7..b13c3e3 100644
--- a/all_subsets.cpp
+++ b/all_subsets.cpp
@@ -16,7 +16,7 @@ Example : If S = [1,2,3], a solution is:
   [2],
   [2, 3],
   [3],
-]
+] where [] is blank set and for n elements 2^n possible sets are  formed. 
 */
 
 void find_subset(vector<int> &A, vector<vector<int>> &result, vector<int> &aux, int i){
@@ -38,4 +38,4 @@ vector<vector<int> > Solution::subsets(vector<int> &A) {
     find_subset(A, result, aux, i);
     sort(result.begin(),result.end());
     return result;
-}
\ No newline at end of file
+}