[REBOL] Timing Functions and Merge Sort (was: forever loops and cpu usage)
From: lmecir::mbox::vol::cz at: 9-Feb-2004 9:57
Paul Tretter napsal(a):
>That's very interesting. With your functions are you able to determine the
>optimum performance wait time?
>
Yes. I am using my timing functions to determine optimum performance in
many situations.
> And if so, is it platform independent?
>
The system clock tick is platform dependent. OTOH, the 0.001 limit for
the WAIT function looks like platform independent. Below the limit the
WAIT function doesn't wait at all, it returns "immediately" as my
measurements seem to prove.
> This
>information is really necessary to get published if people are making
>platform independent scripts.
>
You can find the functions here:
http://www.compkarori.com/vanilla/display/include.r - My
dependancy-resolving function
http://www.compkarori.com/vanilla/display/seconds.r - Function computing
time between two dates in seconds
http://www.compkarori.com/vanilla/display/timblk.r - Timing functions
Moreover, I uploaded my Merge Sort implementation (I am using it since
Rebol 1.x days and this is not the first time I am publishing it):
http://www.compkarori.com/vanilla/display/msort.r
-L
