Hi!
8-éÀÌ-2004 22:10 [EMAIL PROTECTED] (Michael Devore) wrote to [EMAIL PROTECTED]:
MD> I only know of one original pmode CWSORT and it a) doesn't use DJGPP and b)
MD> uses a shell sort which doesn't consume indefinite amounts of stack.
1. Shell sort is slower than qsort. 2. For sorting array of strings plain shell sort, qsort, etc are not very good solution. Especially when there is "external storage".
1. Yes. But for the average numbers of elements you see people use it isn't that much slower except in pathological cases. Shell a good simple compromise sort. Not having to fool with a variable stack consumption is nice, too.
2. CWSORT is more than sufficiently fast for most real world applications. In fact, it's one of the few free programs I've written which later completely surprised me by generating income when I was (twice) hired to custom rework it to support commercial and proprietary software. The code was used to sort strings, including conditionals like case sensitivity and offsets. Much of the optimization is a matter of proper setup within the sort, e.g. I believe two or possibly three levels of indirection were used, along with replaceable code sections.
Here would be one case where theory is trumped by practice. Naturally, very huge sort arrays for specialty applications should get a custom-designed or high-performance sort better tuned for the need, with lower algorithmic completion times.
------------------------------------------------------- This SF.Net email sponsored by Black Hat Briefings & Training. Attend Black Hat Briefings & Training, Las Vegas July 24-29 - digital self defense, top technical experts, no vendor pitches, unmatched networking opportunities. Visit www.blackhat.com _______________________________________________ Freedos-devel mailing list [EMAIL PROTECTED] https://lists.sourceforge.net/lists/listinfo/freedos-devel
