[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: octave benchmark test
From: |
David Bateman |
Subject: |
Re: octave benchmark test |
Date: |
Sun, 7 Mar 2004 15:07:19 +0100 |
User-agent: |
Mutt/1.4.1i |
Daprès Paul Thomas <address@hidden> (le 07/03/2004):
> Sorting of 2,000,000 random values__________________ (sec): 1.696
> (0.9027)
This slowup with octave is also a choice. The sort code in octave-forge
uses the mergesort code from python, while matlab uses a quicksort
algorithm. The benchmark above is reversed if partially ordered lists
are used, as for instance often happen in interpolation codes. So octaves
loss in the above benchmark shows more about the choices of the person
writing the benchmark than the octaves relative performance. Benchmarks
are all figments of someones deranged imagination...
D.
--
David Bateman address@hidden
Motorola CRM +33 1 69 35 48 04 (Ph)
Parc Les Algorithmes, Commune de St Aubin +33 1 69 35 77 01 (Fax)
91193 Gif-Sur-Yvette FRANCE
The information contained in this communication has been classified as:
[x] General Business Information
[ ] Motorola Internal Use Only
[ ] Motorola Confidential Proprietary
-------------------------------------------------------------
Octave is freely available under the terms of the GNU GPL.
Octave's home on the web: http://www.octave.org
How to fund new projects: http://www.octave.org/funding.html
Subscription information: http://www.octave.org/archive.html
-------------------------------------------------------------