Re: A89: Re: Re: Folder List

To: assembly-89@lists.ticalc.org
Subject: Re: A89: Re: Re: Folder List
From: Olle Hedman <oh@hem.passagen.se>
Date: Tue, 20 Jun 2000 21:56:07 +0200
References: <200006201940.e5KJe9624735@neretvica.utic.net.ba>
Reply-To: assembly-89@lists.ticalc.org

I was not familiar with qsort from stdlib.h, but yes, I guess it could be good
if you dont want to write your own, and doesn't have any concern about space.
Speed I do not know anything about. What algoritm do qsort use? It didn't say in
my man-pages.
But my statement still stands. with small amounts of data, there is no need for
advanced routines, and it is most probably even plain bad and stupid to use.

//Olle

Zeljko Juric wrote:
> > quite pointless to use a heavy duty routine like quicksort for such
> > small amount of data. If you have just 20-30 dataposts it will most
> > probably end up takeing more time with quicksort then with a simple
> > bubblesort or selectionsort or something.
> 
> But why not to use qsort from stdlib.h?
> 
> Zeljko Juric

Follow-Ups:

Re: A89: Re: Re: Folder List

From: "Sebastian Reichelt" <SebastianR@gmx.de>

References:

Re: A89: Re: Re: Folder List

From: "Zeljko Juric" <zjuric@utic.net.ba>