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 20:01:38 +0200
References: <003701bfdada$c30f2aa0$0100a8c0@konpyuutaa> <003c01bfdadb$65d341e0$0201a8c0@sparta.lu.se> <000a01bfdadd$2185aee0$540b1818@twcny.rr.com>
Reply-To: assembly-89@lists.ticalc.org


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.

//Olle

Sebastian Reichelt wrote:
> 
> Hi!
> 
> Is this for BASIC or ASM?  If it is for a BASIC program, try the SortA
> command, or, if it doesn't work, look up "Sebastian's Calculus Package" in
> the TI-89 BASIC Math Programs.  In the "Required Packages," there is a
> "SortList" function.  It was designed for numbers only, but it should be
> easy to modify.
> 
> If it is for ASM, you should probably use a linked list to store the values,
> and then look up a sorting algorithm for linked lists.  Or you could
> dynamically create an array at runtime, if you know how many variables there
> are before you actually get their names, and use QuickSort.
> 
> Bye,
> Sebastian

References:

A89: Folder List

From: "Brian Maxwell" <bmaxwell@remc11.k12.mi.us>

A89: Re: Folder List

From: "Niklas Brunlid" <e96nbr@efd.lth.se>

A89: Re: Re: Folder List

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