Optimizing Java using D

[Andrea Fontana via Digitalmars-d]

Whoops, "comparison based"

On Monday, 23 June 2014 at 15:57:12 UTC, Andrea Fontana wrote:
> How can this be proven?
> Is it valid only for "swap-based" sorting algorithms?
>
> For example, radix sort is stable and its complexity is O(kn). 
> Is there a faster unstable sort?
>
> On Monday, 23 June 2014 at 15:38:25 UTC, Chris Cain wrote:
>> Technically, you can prove that there exists some unstable 
>> sort that is always faster than a stable sort. Andrei showed 
>> me this once: