Re: [U2] QSORT (Or something like that)

Hello, I adapted a Heapsort algorithm a while back that I had obtained from a book (Turbo Algorithms circa 1989). The original had been written in Turbo Basic or Turbo Pascal, I forget which. I adapted it so that I could use work dimmed arrays (even if they were smaller than the dynamic

[U2] QSORT (Or something like that)

I read a post from Charlie thanking Tony for the QSORT tip.  I remember using something like this a long time ago... What I am looking for is a way to sort the values of a dynamic array.  Lets  say that attributes 1,2,3 of the variable A are all associated.  I want to sort the values of A1 and

Re: [U2] QSORT (Or something like that)

You can find these subroutines on PickWiki.com: CALL ROW2COL(A) ;* flip fields to values CALL QUICKSORT(A, 1, AR) ;* sort on first value CALL ROW2COL(A) ;* flip back rex ___ U2-Users mailing list U2-Users@listserver.u2ug.org

Re: [U2] QSORT (Or something like that)

From: Rex Gozar rgo...@gmail.com To: U2 Users List u2-users@listserver.u2ug.org Sent: Mon, May 24, 2010 1:27:32 PM Subject: Re: [U2] QSORT (Or something like that) You can find these subroutines on PickWiki.com: CALL ROW2COL(A) ;* flip fields to values CALL QUICKSORT(A, 1, AR

Re: [U2] QSORT (Or something like that)

Gozar rgo...@gmail.com To: U2 Users List u2-users@listserver.u2ug.org Sent: Mon, May 24, 2010 1:27:32 PM Subject: Re: [U2] QSORT (Or something like that) You can find these subroutines on PickWiki.com: CALL ROW2COL(A) ;* flip fields to values CALL QUICKSORT(A, 1, AR) ;* sort on first