Re: Array vs Temporary Tables, benchmark testing

["Johnson, Dan" <Dan_Johnson@WRIGHTEXPRESS.COM>]

There must be some good SQR sorting algorithms out there somewhere. Ray O.
probably knows where to get or has some good sorting algorithms. He has a
great SQR website with all kinds of useful info. Use selection sort, merge
sort, or heap sort instead of bubble sort though. Bubble sort in an O(n2)
algorithm whereas the other three are only O(nLog(n)).


        -----Original Message-----
        From:   Rick Creel [SMTP:Rick_Creel@AONCONS.COM]
        Sent:   Tuesday, September 14, 1999 10:06 AM
        To:     Multiple recipients of list SQR-USERS
        Subject:        Re: Array vs Temporary Tables, benchmark testing

        There may not be any built in sort functions with arrays, but you
could write a
        routine to do an old fashion "bubble sort" on the array.  Since
arrays are
        memory resident, I would tend to agree that arrays would be much
faster than a
        temp table.





        William Hart <WRHart@AOL.COM> on 09/14/99 08:54:47 AM

        Please respond to SQR-USERS@list.iex.net

        To:   Multiple recipients of list SQR-USERS <SQR-USERS@list.iex.net>
        cc:    (bcc: Rick Creel/IT/Aon Consulting)
        Subject:  Re: Array vs Temporary Tables, benchmark testing




        Well,  My 2 cents say that Arrays are faster than Temporary tables.
Temp
        tables require read/write, Network traffic etc.. Granted that SQR is
a little
        more rigid with Arrays than some other 3GL's, but they are good in
their own
        right.  The down-size is that there are no good sorting functions.
That is
        where the value of the temp tables come in.

        Bill