literal

If I have to do the basic tree with these declarations typedef struct item { char petname[20]; char petkind[20]; } Item; typedef struct node { Item item; struct node * left; /* pointer to right branch */ struct node * right; /* pointer to left branch */ } Node; typedef …

Any experiences here?! Thanks,

[CODE]int i, j; for(i=2;i<1000;i++){ for(j=2;i/j;j++){ if(!(i%j)) break; if(j>(i/j)) cout<<i<<" is prime\n"; } }[/CODE] Can somebody experienced clear me how this program actually finds prime numbers... The line with the last if condition confuses me most -> j > (i/j)

Good question; how good this book really is?!

Can somebody on a beginners level explain the code below [CODE] int i, j; for(i=2; i<16; i++) { for(j=2; j<=(i/j); j++) //confusion 1 if(!(i%j)) break ; if(j>(i/j)) cout<<i<<" / "<<j<<endl;//confusion 2 } [/CODE]

I'm still interested if someone read this book since it's based upon standard C++?! Can one learn C++ over Visual... I mean what's difference anyway, except M$ is involved in Visual ?!

1. What are the most recommended books on c++ algorithms? 2. Algorithms in C++ by Robert Sedgewick - any experiences? Thx