The last such book I saw was the Seminal work done by Donaly Knuth called – “The Art of Computer Programming”. Volumes 1-3. I would still refer this book to anyone who is interested in this field.
printf(“Please enter the ammount of zero’s and ones!!!:_)”);
scanf(“%d%d”,&zero,&one);
//Combinations(zero,one);
Recurs(zero,one);
}
void Combinations(int zero,int one)
{ static char *string=(char*)calloc(1,zero one 2),*StartPoint;
int counter,possition=1;
StartPoint=string;
[...] (via Blue Sky on Mars) [...]
The last such book I saw was the Seminal work done by Donaly Knuth called – “The Art of Computer Programming”. Volumes 1-3. I would still refer this book to anyone who is interested in this field.
//(c)Yarco; all possible combinations of N-1-nes and K-0-es; enjoy..and..yeh…I //know it’s a crapy code…writen in less than 30 mins though;)))))
#include
#include
#include
#include
void Combinations(int zero,int one);
void Recurs(int zero,int one);
void main()
{ int zero,one;
printf(“Please enter the ammount of zero’s and ones!!!:_)”);
scanf(“%d%d”,&zero,&one);
//Combinations(zero,one);
Recurs(zero,one);
}
void Combinations(int zero,int one)
{ static char *string=(char*)calloc(1,zero one 2),*StartPoint;
int counter,possition=1;
StartPoint=string;
for(counter=0;counter