TECHARRAZ

RECURSION Recursion is somewhere defined as the tool to fast iteration, whereas some people find it obfuscating and detest it with proof of it being slow and occupancy of unnecessary space. Recursion is not something which occurs to us directly or naturally. We generally tend to think inward to a concluding point, and come out with [...]

Maximal Munch Problems 1.Ever tried evaluating this expression? ++++p->*mp 2.Ever dealt with the “Sergeant operator”? template class R {    // . . .    friend ostream &amp;operator <<< // a sergeant operator?        T >( ostream &amp;, const R &amp; ); }; 3.Have you ever wondered whether the following expression is legal? a+++++b Welcome to the world of maximal munch. In one of the [...]

In c, there are some keywords the usage of which is not very clearly defined (in textbooks). But they are an important part of the language. Here are some I could find :: Volatile:: The keyword volatile is used to specify that the value of a variable can be changed explicitly by a program even in the [...]

1. Name :: A variable name reflects it’s presence and usage in a program. A variable name thus should be concise, understandable, definitely memorable and if possible pronounceable. Global :- Use descriptive names for global variables as they can crop up anywhere in a code. Another good method is to include a comment with each global [...]

1. Randomized algorithms :: Randomized algorithms rely on the statistical properties of random numbers. One example of a randomized algorithm is quicksort. In quicksort we take a set of data, sort it selecting a pivot value, ie; we select a central value(as in having a central tendency) and then sort all the elements before and after it. [...]