human
Print all possible combinations of r elements in a given array of size n | The main function that prints all combinations of size r in arr [ ] of size n . This function mainly uses combinationUtil ( ).
A temporary array to store all combination one by one.
Print all combination using temprary array 'data[]  .
arr [ ] -- -> Input Array n -- -> Size of input array r -- -> Size of a combination to be printed index -- -> Current index in data [ ] data [ ] -- -> Temporary array to store current combination i -- -> index of current element in arr [ ].
Current cobination is ready , print it.
When no more elements are there to put in data [ ].
current is included , put next at next location.
current is excluded , replace it with next ( Note that i + 1 is passed , but index is not changed ).
Driver Code"
How can the above be solved in Python?

Write me a code to print all possible combinations of r elements in a given array of size n and the other steps required?
assistant
#Here is code to print all possible combinations of r elements in a given array of size n and the other steps required.
 def printCombination ( arr , n , r ) :
	data = [ 0 ] * r
	combinationUtil ( arr , n , r , 0 , data , 0 )
def combinationUtil ( arr , n , r , index , data , i ) :
	if ( index == r ) :
		for j in range ( r ) :
			print ( data [ j ] , end = " ▁ " )
		print ( )
		return
	if ( i >= n ) :
		return
	data [ index ] = arr [ i ]
	combinationUtil ( arr , n , r , index + 1 , data , i + 1 )
	combinationUtil ( arr , n , r , index , data , i + 1 )
if __name__ == " _ _ main _ _ " :
	arr = [ 1 , 2 , 3 , 4 , 5 ]
	r = 3
	n = len ( arr )
	printCombination ( arr , n , r )