Sort trouble

[Don]

Stewart Gordon wrote:
> bearophile wrote:
> <snip>
>> - It can be more flexible (for example mine accepts an optional "key" 
>> mapping function)
> 
> What is there preventing a built-in sort being implemented to do this?

It's more difficult than doing it in a library. For apparently no 
benefit at all.

> 
>> - It can be a template, so it can be faster (confirmed. I have a sort 
>> that is sometimes 3+ times faster).
> <snip>
> 
> What is there preventing a built-in sort being implemented in this way?
> 
> Stewart