Justok,
If I remember my compiler theory class, every recursive algorithm can be expressed in non-recursive code. But where an algorithm can be expressed recursively the code is typically more "elegant". Here's one from my toolbox of debugging code:
function FullName( roObject )
if ( IsObject( m.roObject ) )
if ( ( type( "roObject.Parent" ) == 'O' ) and ;
( roObject.Name != "Microsoft Visual FoxPro" ) )
return ( FullName( roObject.Parent ) + "." + roObject.Name )
else
return roObject.Name
endif
else
return ""
endifAnd if it wasn't for the error checking code the above stuff would show it's simplicity.
>Oh.... I nearly forgot Recursion because I can use simple SQL command or
>control loop instead of it. But I really want to know, is there any cases
>need to program it in recursion?!
