×
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.
My benchmarks have shown SORTA to be faster than qsort() on very large
arrays. However, I don't think it's a "good" performance reason -- the
difference isn't big enough, IMHO, to choose one over the other.
(However, other methods of sorting, such as the QLGSORT API, keyed data
queues, and user indexes were dramatically slower than either SORTA or
qsort() and I would not use those methods for large amounts of data.)
SORTA's biggest advantage is that it's simpler/shorter to code.
Dennis Lovelady wrote:
I stopped using SORTA years ago, in favor of qsort(). But this discussion
makes me wonder: is there a good performance reason for choosing one over
the other?
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.
midrange.com
