shailendraagarwal11
BAN USER1 #include <iostream>
2
3 using namespace std;
4
5 void print(int *sets, int k)
6 {
7 for(int i=0; i<k; i++)
8 cout << sets[i] << "\t";
9 cout << "\n";
10 }
11
12 void subsets(int A[], int n, int k, int *sets, int index, int indexA)
13 {
14 if(index == k)
15 {
16 print(sets, k);
17 return;
18 }
19
20 if(indexA >= n || n-indexA < k-index)
21 return;
22
23 sets[index] = A[indexA];
24 subsets(A, n, k, sets, index+1, indexA+1);
25 subsets(A, n, k, sets, index, indexA+1);
26 }
27
28 int main()
29 {
30 int A[] = {1,2,3,4,5};
31
32 int n=5, k=3;
33
34 int *sets = new int[k];
35
36 subsets(A, n, k, sets, 0 , 0);
37
38 delete[] sets;
39
40 return 0;
41 }
LIS in the question should be 1 3 4 6
- shailendraagarwal11 February 10, 2013
RepRebecaMoore, Consultant at AMD
I am working as an art teacher with “Glory High School,” and develop interests for art and creative expression in ...
binary search can be done in sorted array only
- shailendraagarwal11 February 12, 2013