[m-dev.] Sorting results

[Fergus Henderson]

On 07-Feb-2001, Ralph Becket <rbeck at microsoft.com> wrote:
> What strikes me as most odd is that mergesort should be largely 
> insensitive to the order of the input data, yet there's quite a
> bit of variance.  I used time__clock//1 and converted the results
> to milliseconds before computing the ratios (this was under linux).

I'd advise using benchmarking__benchmark_det rather than time__clock.
With time__clock, the compiler might be doing reordering,
deforestation, or other optimizations that mean you are not measuring
what you think you're measuring.

-- 
Fergus Henderson <fjh at cs.mu.oz.au>  |  "I have always known that the pursuit
                                    |  of excellence is a lethal habit"
WWW: <http://www.cs.mu.oz.au/~fjh>  |     -- the last words of T. S. Garp.
--------------------------------------------------------------------------
mercury-developers mailing list
Post messages to:       mercury-developers at cs.mu.oz.au
Administrative Queries: owner-mercury-developers at cs.mu.oz.au
Subscriptions:          mercury-developers-request at cs.mu.oz.au
--------------------------------------------------------------------------