comp.lang.idl-pvwave archive
Messages from Usenet group comp.lang.idl-pvwave, compiled by Paulo Penteado

Home » Public Forums » archive » looking for sort procedure
Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend 
Return to the default flat view Create a new topic Submit Reply
Re: looking for sort procedure [message #7869 is a reply to message #7778] Tue, 21 January 1997 00:00 Go to previous messageGo to previous message
j.wendelstorf is currently offline  j.wendelstorf
Messages: 2
Registered: August 1996
Junior Member
> R. Bauer wrote:
>>
>> It was surprising me that's idl's build-in sort procedure is very very
>> slow.
>>
>> for this example it needs on may RS6000 AIX more than 2 minutes.
>>
> Indeed. And it looks like it's not just IDL. PV-Wave 6.01 running on a
> HP9000 J200/99 using HP-UX 9.05a took 4.5 minutes to execute this code.

I would estimate IDL uses the qsort-routine from the systems C-library.
qsort in general sorts with O(n log(n)) [n=#of items], but degenerates
to O(n^2) for unsorted or reverse sorted data. Maybe the "fast" systems
have a workaround, the other did not.

.. Just an idea, keeping "Sorting & Searching"-lessons in mind.

Jens

+----------------+---------------+---------------+---------- ------------+
|Jens Wendelstorf|Inst.of.Welding+TU-Braunschweig|j.wendelstorf@tu-bs.de|
+----------------+---------------+---------------+---------- ------------+
[Message index]
 
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Previous Topic: Speckle
Next Topic: KILL_NOTIFY Programs

-=] Back to Top [=-
[ Syndicate this forum (XML) ] [ RSS ] [ PDF ]

Current Time: Wed Oct 15 16:18:06 PDT 2025

Total time taken to generate the page: 1.03945 seconds