Re: Neat and tidy solution to following problem?

[achrist@easystreet.com]

"chris.danx" wrote:
> 
> I'm just wondering if there's a way to have something similar in Ada 
> 95 like have two items returned from a function but not have to 
> declare an explicit type.
> 

You would do this in Ada as a procedure (not a function) with multiple
in out parameters.  

I'd be interested to know how well recursion in Ada substitutes for 
looping (efficiency-wise).  Some of the functional languages are not
really high performance, and it would be interesting to see if you could
get about the same level of performance from the same style of coding 
using a procedural language.  In your example, for example, our spec 
might say that words are never very long (say more than 50 characters or 
so), so we wouldn't have to worry about problems with very deep
recursions.

However, Ada is a procedural language.  If you are using Ada, then 
presumably you are not allergic to procedural devices like looping
and in out parameters.  A recursive algorithm that eliminates but one
level of straightforward looping could be a puzzlement to an Ada reader.


Al