Suffix tree: Deepest Internal nodeI read somewhere that you can find the longest repeating substring of a given string by finding the ...
Premature return from recursion stackYes. An iterative approach is possible. But I asked this question only because in previous recursion...
Premature return from recursion stack@Athar: The bool thing is fine. I coded this in a C Compiler and that is why I did not use the bool....
Premature return from recursion stackI wrote a code for detecting if a given binary tree is a Binary search tree. I have the followin...
Finding EndianessYes. Thats what I expected. So, in [code]if (*(unsigned char *)&a==1)[/code] what I am trying...
This user does not accept Private Messages