Re: [PATCH 6/7] stdlib: Optimization qsort{_r} swap implementation

[Paul Eggert <eggert at cs dot ucla dot edu>]

On 01/23/2018 10:28 AM, Adhemerval Zanella wrote:

> Again do we really to over-engineering it? GCC profile usage shows 95% to total
> issues done with up to 9 elements and 92% of key size 8.  Firefox is somewhat
> more diverse with 72% up to 17 elements and 95% of key size 8.

You have a point. I assume these were on machines with 64-bit pointers. 
In that case why bother with a size-4 special case? Special-casing 
pointer-size items should suffice.

> I would rather add specialized sort implementation such as BSD family, heapsort
> and mergesort, to provide different algorithm for different constraints (mergesort
> for stable-sort, heapsort/mergesort to avoid worse-case from quicksort). We might
> even extend it to add something like introsort.

Each of us over-engineers in his own way (:-).