Skip to content

update subset_generation.py #10378

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 2 commits into from
Closed

update subset_generation.py #10378

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
71b174d
Update subset_generation.py
airwakz Oct 13, 2023
2a4ab5e
Update subset_generation.py
airwakz Oct 13, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
43 changes: 10 additions & 33 deletions dynamic_programming/subset_generation.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,44 +1,21 @@
# 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
"""
def combination_util(arr, n, r, index, data, i, result):
if index == r:
for j in range(r):
print(data[j], end=" ")
print(" ")
result.append(tuple(data[:r])) # Append the combination to the result list
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()

combination_util(arr, n, r, index + 1, data, i + 1, result)
combination_util(arr, n, r, index, data, i + 1, result)

def print_combination(arr, n, r):
# A temporary array to store all combination one by one
data = [0] * r
# Print all combination using temporary array 'data[]'
combination_util(arr, n, r, 0, data, 0)

result = [] # Initialize an empty list to store the combinations
combination_util(arr, n, r, 0, data, 0, result)
return result # Return the list of tuples

if __name__ == "__main__":
# Driver code to check the function above
arr = [10, 20, 30, 40, 50]
print_combination(arr, len(arr), 3)
# This code is contributed by Ambuj sahu
combinations = print_combination(arr, len(arr), 3)
for combo in combinations:
print(combo)