× The internal search function is temporarily non-functional. The current search engine is no longer viable and we are researching alternatives.
As a stop gap measure, we are using Google's custom search engine service.
If you know of an easy to use, open source, search engine ... please contact support@midrange.com.



Bob Cozzi wrote:
If you don't want to use QSort, you might want to wait for V5R3.
The problem with that technique is that is sorts all 5000 elements
regardless of how many are actually in the array at the time. So you could
potential end up with a bunch of crap at the start of the array.
I wrote an article on using QSORT to sort data structures (and showed how to
apply that to a subfile) in my free news letter. Go to www.mcpressonline.com/midrangedev and click on the article that
contains the phrase "Subfile sort".
Bob Cozzi



Bob: Why would you wait for V5R3? Is there something in V5R3 that might help someone sorting an array data structure? (Answer: no)


The C run-time library function qsort() is a good choice prior to the day (who knows when?) when SORTA can handle array data structures. And probably more efficient too than SORTA. Currently, SORTA uses a shell sort. Although reasonably good, it's not as good as the quick sort algorithm used by qsort().

Cheers! Hans


As an Amazon Associate we earn from qualifying purchases.

This thread ...

Replies:

Follow On AppleNews
Return to Archive home page | Return to MIDRANGE.COM home page

This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].

Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.