Hi, > Qsort in stdlib uses median selection to avoid O(n^2). Heapsort is > _slower_ than qsort. Introsort in not in any standard lib. Ah, thanks, I didn't know that. That ought to suffice to make sorting reliably fast, which is important for large zones. Cheers, -Rick