On Thu, 2004-06-10 at 13:25, Michael Borek wrote:
> My new solution is similar to this, but eliminates the tab and move by using
> indexing:
>
> procedure order(s)
> s ? every (outs:="") ||:= s[upto(!cset(s))]
> return outs
> end
>
> Are you planning on providing timings for all the solution? I found the one above
> to be the fastest, both for short (by at least a factor of 2) and long (marginal
> improvement) strings.
I think I've timed most of the solutions now, though if this
keeps up maybe I should put out a summary, since the timings
are spread over a bunch of emails now!
Here are the times for the above (it turns out that string
subscripting [and probably subscripting in general] is more
expensive then one might think - though this solution is
still plenty fast):
Case 1:
------------------ Michael Borek(2) -----------------------
1.80s user 0.13s system 98% cpu 1.966 total
Case 2:
------------------ Michael Borek(2) -----------------------
4.23s user 0.12s system 100% cpu 4.339 total
-Steve
--
Steve Wampler -- [EMAIL PROTECTED]
The gods that smiled on your birth are now laughing out loud.
-------------------------------------------------------
This SF.Net email is sponsored by the new InstallShield X.
>From Windows to Linux, servers to mobile, InstallShield X is the
one installation-authoring solution that does it all. Learn more and
evaluate today! http://www.installshield.com/Dev2Dev/0504
_______________________________________________
Unicon-group mailing list
[EMAIL PROTECTED]
https://lists.sourceforge.net/lists/listinfo/unicon-group
