> I'd like to sort an big array of strings. My problem is that I need to
> sort it by columns, which means that I cannot use the included Sub-VI
> 1D-Sort. I downloaded a Sub-VI which does a Bubble Sort, it just works
> great, but since I have more than 2000 rows, the bubble sort is just
> too slow.
> 
> My Question now is, if somebody out there did already rebuild a
> quicksort in LabView. I think it has to be an DLL or a CIN function,
> because LabView doesn't allow recursive calls.
> 
If the bubble sort is just a bit slow, you may want to modify it
to be a selection sort.  Still a simple algorithm.  It has the same
number of comparisons, and way fewer assignments.
Selection sort is really simple to implement.  Search for the largest
item. Swap the last item with
 the largest.  Next iteration of the
loop, you leave out the last item.  This will be faster than bubble
sort, but will not be as fast as quicksort.
Quicksort can be implemented without recursion.  I don't have one
at my disposal, but it is pretty straightforward using a shift-
register to hold the items that still need to be looked at.
Greg McKaskle