csrComb.h

   1 void csr_comb_init( int const M, int p[] )
   2 {
   3         for( int i = 0; i < M; i ++ )
   4         {
   5                 p[ i ] = i;
   6         }
   7 }
   8
   9 int csr_comb( int M, int N, int p[] )
  10 {
  11         for( int j = M-1; j >= 0; --j )
  12         {
  13                 if( p[j] < N-(M-j) ) // Can J be incremented?
  14                 {
  15                         p[j] ++;
  16                         for( int k = j+1; k < M; k ++ ) // Adjust following indexes
  17                         {
  18                                 p[k] = p[j]+k-j;
  19                         }
  20                         return 1;
  21                 }
  22         }
  23         return 0;
  24 }