Sorting.

I have an application that reads data, processes it and places the resulting data into memory arrays(one dimensional) for display to the screen. Sometimes the array may have 8 rows filled or 800 rows filled, I don't know the number until the process is done. Do you think it would be faster to do a memory sort(ie interchange, bubble, whatever) or write the data to temp table and read it back in proper order. My concern is at what number of records(if any) would the memory sort become slower than using a temp table. Machine is a RS6000/550, however many users are on the system. Rick Tucker rickt%indcon@wybbs.mi.org uunet!4gen!indcon!rickt