[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: benchmarks - sort
|
From: |
John W. Eaton |
|
Subject: |
Re: benchmarks - sort |
|
Date: |
Tue, 6 Jan 2004 09:50:09 -0600 |
On 6-Jan-2004, Schloegl Alois <address@hidden> wrote:
| One reason, for the bad performance of the sort algorithm might be the
exception
| handling of NaNs. See also
| http://www.octave.org/octave-lists/archive/bug-octave.2001/msg00047.html
|
| Sorting on the binary level might be helpful, because the bit patterns of the
| IEEE754 numbers provide the correct sorting order. This is
| -inf < -1 < 0 < 1 < inf < NaN
Can you explain precisely what you mean by sorting on the binary
level?
jwe
- benchmarks, Paul Kienzle, 2004/01/05
- Re: benchmarks, David Bateman, 2004/01/06
- Re: benchmarks - sort, Schloegl Alois, 2004/01/06
- benchmarks, John W. Eaton, 2004/01/06
- packages (was: benchmarks), John W. Eaton, 2004/01/06
- randn benchmarks, David Bateman, 2004/01/22