human
Print all increasing sequences of length k from first n natural numbers | A utility function to print contents of arr [ 0. . k - 1 ].
A recursive function to print all increasing sequences of first n natural numbers . Every sequence should be length k . The array arr [ ] is used to store current sequence ..
If length of current increasing sequence becomes k , print it.
Decide the starting number to put at current position : If length is 0 , then there are no previous elements in arr [ ] . So start putting new numbers with 1. If length is not 0 , then start from value of previous element plus 1..
Increase length.
Put all numbers ( which are greater than the previous element ) at new position ..
This is important . The variable ' len ' is shared among all function calls in recursion tree . Its value must be brought back before next iteration of while loop.
This function prints all increasing sequences of first n natural numbers . The length of every sequence must be k . This function mainly uses printSeqUtil ( ).
An array to store individual sequences.
Initial length of current sequence.
Driver Code"
Solution in Python:
assistant
#Here is code to print all increasing sequences of length k from first n natural numbers and the other steps required.
 def printArr ( arr , k ) :
	for i in range ( k ) :
		print ( arr [ i ] , end = " ▁ " ) ;
	print ( ) ;
def printSeqUtil ( n , k , len1 , arr ) :
	if ( len1 == k ) :
		printArr ( arr , k ) ;
		return ;
	i = 1 if ( len1 == 0 ) else ( arr [ len1 - 1 ] + 1 ) ;
	len1 += 1 ;
	while ( i <= n ) :
		arr [ len1 - 1 ] = i ;
		printSeqUtil ( n , k , len1 , arr ) ;
		i += 1 ;
	len1 -= 1 ;
def printSeq ( n , k ) :
	arr = [ 0 ] * k ;
	len1 = 0 ;
	printSeqUtil ( n , k , len1 , arr ) ;
k = 3 ;
n = 7 ;
printSeq ( n , k ) ;