Given an array of size n, generate and print all possible combinations of r elements in array. Examples:
Input : arr[] = [1, 2, 3, 4],
r = 2
Output : [(1, 2), (1, 3), (1, 4), (2, 3), (2, 4), (3, 4)]
This problem has existing recursive solution please refer Print all possible combinations of r elements in a given array of size n link. We will solve this problem in python using itertools.combinations() module.
What does itertools.combinations() do ?
It returns r length subsequences of elements from the input iterable. Combinations are emitted in lexicographic sort order. So, if the input iterable is sorted, the combination tuples will be produced in sorted order.
- itertools.combinations(iterable, r) : It return r-length tuples in sorted order with no repeated elements. For Example, combinations(‘ABCD’, 2) ==> [AB, AC, AD, BC, BD, CD].
- itertools.combinations_with_replacement(iterable, r) : It return r-length tuples in sorted order with repeated elements. For Example, combinations_with_replacement(‘ABCD’, 2) ==> [AA, AB, AC, AD, BB, BC, BD, CC, CD, DD].
Python3
# Function which returns subset or r length from nfrom itertools import combinationsdef rSubset(arr, r): # return list of all subsets of length r # to deal with duplicate subsets use # set(list(combinations(arr, r))) return list(combinations(arr, r))# Driver Functionif __name__ == "__main__": arr = [1, 2, 3, 4] r = 2 print (rSubset(arr, r)) |
[(1, 2), (1, 3), (1, 4), (2, 3), (2, 4), (3, 4)]
This article is contributed by Shashank Mishra (Gullu). If you like Lazyroar and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the Lazyroar main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
