>>> Has anyone come up with a method to do recursions, when the number >>> of recursive levels is not known in the first place? >> >> Well, sure -- most recursive algorithms are that way. What >> specific problem did you have in mind?
When I do something like this it runs until whatever it needs to accomplish is finished or some failure condition is met. An example that comes to mind is an algorithm to optimize a machine path given a set of coordinates. So once its done (all the points have been accounted for) it exits the loop. HTH, -seanA _______________________________________________ Unsubscribe or switch delivery mode: <http://www.realsoftware.com/support/listmanager/> Search the archives of this list here: <http://support.realsoftware.com/listarchives/lists.html>
