OpenEuphoria

RE: Slice sequence--new algorithm

• Posted by Al Getz <Xaxo at aol.com> Feb 21, 2001
• 404 views

Lutz & Juri:

Hi Juri,
  Nice algorithm! I think i'll use that one myself.
  Since now your in the mood, perhaps you would care to
  generalize one step further:
    Adapt your algorithm to handle an arbitrarily complex
    sequence.  The time factor has stumped me a bit, as
    elements wont be the same in all locations in the sequence, 
    therefore sometimes a larger element will replace a smaller 
    element, which brings in a longer time cost factor.  If there
    was some way around that...
    Perhaps recursion would help for the more complex case, even
    if it takes more time to complete, which brings a second 
    question to mind which ill ask in a separate post about
    recursion and memory resources.

Hi Lutz,
  Thanks for your insight!

Lutz wrote:
  >>Yes, but nowadays time is more valuable than memory space!
Time isnt always independent of memory: if you get low on memory
and windows resorts to disk swapping, it could take 10x longer to
run then a more complicated program that doesnt use up all the
ram in the system.

  >>What do you think EUPHORIA does internally?
Check out Rob's response to the thread.


Have fun with it!
--Al