[m-rev.] diff: improve efficiency of list__merge_sort

[Simon Taylor]

On 28-Aug-2001, Fergus Henderson <fjh at cs.mu.OZ.AU> wrote:
> On 24-Aug-2001, Simon Taylor <stayl at cs.mu.OZ.AU> wrote:
> > 
> > library/list.m:
> > 	Improve efficiency of list__merge_sort by not recomputing
> > 	the length of the list at each step.
> 
> How much difference does this make?

Very little, the time taken by list__merge_sort is probably dominated
by the memory allocation in list__split_list and list__merge. It can't
hurt, and I find the new version slightly more readable anyway.

Simon.
--------------------------------------------------------------------------
mercury-reviews mailing list
post:  mercury-reviews at cs.mu.oz.au
administrative address: owner-mercury-reviews at cs.mu.oz.au
unsubscribe: Address: mercury-reviews-request at cs.mu.oz.au Message: unsubscribe
subscribe:   Address: mercury-reviews-request at cs.mu.oz.au Message: subscribe
--------------------------------------------------------------------------