Procedures may not only be called, but can call procedures themselves. Since any procedure that is visible can be called, a procedure may call itself. This self-reactivation is called recursion. Its use is appropriate when an algorithm is recursively defined and in particular when applied to a recursively defined data structure.
KeywordsRecursive Call Recursion Procedure Module Permute Chess Board Syntactic Correctness
Unable to display preview. Download preview PDF.