forked from TheAlgorithms/Python
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsubset_generation.py
97 lines (77 loc) · 2.29 KB
/
subset_generation.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
# Print all subset combinations of n element in given set of r element.
def combination_util(arr, n, r, index, data, i):
"""
Current combination is ready to be printed, print it
arr[] ---> Input Array
data[] ---> Temporary array to store current combination
start & end ---> Staring and Ending indexes in arr[]
index ---> Current index in data[]
r ---> Size of a combination to be printed
>>> combination_util([1, 2, 3], 3, 2, 0, [0, 0], 0)
1 2
1 3
2 3
>>> combination_util([-1,-2,-3], 3, 2, 0, [0, 0], 0)
-1 -2
-1 -3
-2 -3
>>> combination_util([], 0, 2, 0, [0, 0], 0)
>>> combination_util([1], 1, 2, 0, [0, 0], 0)
>>> combination_util([1], 1, 2, 0, [0, 0], 3)
"""
if index == r:
print(" ".join(map(str, data[:r])))
return
# When no more elements are there to put in data[]
if i >= n:
return
# current is included, put next at next location
data[index] = arr[i]
combination_util(arr, n, r, index + 1, data, i + 1)
# current is excluded, replace it with
# next (Note that i+1 is passed, but
# index is not changed)
combination_util(arr, n, r, index, data, i + 1)
# The main function that prints all combinations
# of size r in arr[] of size n. This function
# mainly uses combinationUtil()
def print_combination(arr, n, r):
"""
>>> print_combination([1, 2, 3], 3, 2)
1 2
1 3
2 3
>>> print_combination([-1,-2,-3], 3, 2)
-1 -2
-1 -3
-2 -3
>>> print_combination([], 3, 2)
>>> print_combination([1], 3, 2)
>>> print_combination([1, 2, 2], 3, 2)
1 2
1 2
2 2
>>> print_combination(['a', 'b', 'c'], 3, 2)
a b
a c
b c
>>> print_combination([1, 'a', 2], 3, 2)
1 a
1 2
a 2
"""
# A temporary array to store all combination one by one
# returns nothing if n < r
if len(arr) < r:
return
data = [0] * r
# Print all combination using temporary array 'data[]'
combination_util(arr, n, r, 0, data, 0)
if __name__ == "__main__":
# Driver code to check the function above
# arr = [10,20,30,40,50]
import doctest
doctest.testmod()
arr = [10, 20, 30, 40, 50]
print_combination(arr, len(arr), 3)
# This code is contributed by Ambuj sahu