OpenEuphoria

Re: Performance Issues

• Posted by Euman <euman at bellsouth.net> Apr 23, 2001
• 395 views

Try to find ABGTE II on the RDS contrib site ( Tutorial on Euphoria Programming)
this will help you know alittle more about sequences and lengths and integers
etc....

Euman

> I would like to get information on performance issues related to
> Euphoria such as:
>   Is length(a sequence of length n) an O(1) or O(n) time cost?

>      i.e. Is the time constant or proportional to the length of the
>            sequence?

>   If x is a very large sequence, does x = fn(x), where values in
>      x are changed, and x is returned, require x storage, or 2*x?

>      What about s = fn(x)?
>   What if function fn(x) is recursive?
>
> The Euphoria doc has a relatively short discussion on performance,
> but not enough to give me any kind of feel for what is going on under
> the covers.
>
> Verne