Re: Sort items in a list without OSAXen
Re: Sort items in a list without OSAXen
- Subject: Re: Sort items in a list without OSAXen
- From: Emmanuel <email@hidden>
- Date: Tue, 4 Sep 2001 17:57:42 +0200
At 20:20 +0200 2/09/01, Arthur J Knapp wrote:
>
and when I have completed a more rigourous test, I will post my
>
results.
Had no time to perform exhaustive tests, but here is a summary of our first
results.
size = size of the list (random integers in the range 1 - 500)
SRN = "SortedRefNumbers" (Arthur's)
s = "sort" (Smile's)
SN = "SortedNumbers" (Arthur's)
Timings = milliseconds, performed on a Pismo under 0S9.1. Average over 5 runs.
size SRN s SN
--------------------------------
25 0 33 47
50 7 143 207
200 88 1217 8103
500 93 7100 (still in progress at the time of this writing:)
What seems striking at this step is that SRN does not scale like the
others, which go nearly like n^3 or n^4. More like linear.
Best regards,
Emmanuel