492acdf8c4612015b3312ea1b2bdf348268ff8eb
4 void csr_comb_init( int const M
, int p
[] )
6 for( int i
= 0; i
< M
; i
++ )
12 int csr_comb( int M
, int N
, int p
[] )
14 for( int j
= M
-1; j
>= 0; --j
)
16 if( p
[j
] < N
-(M
-j
) ) // Can J be incremented?
19 for( int k
= j
+1; k
< M
; k
++ ) // Adjust following indexes
29 void csr_comb_print( int M
, int p
[] )
31 for( int i
= 0; i
< M
; i
++ )
33 printf( "%d ", p
[i
] );