Optimizing Java using D

[Alix Pexton via Digitalmars-d]

On 03/07/2014 9:13 AM, Andrei Alexandrescu wrote:
> On 7/3/14, 12:29 AM, Wanderer wrote:
>> Nobody, never, measures sort algorithms by amount of swaps.
>
> That... is quite the claim. -- Andrei

Most of the algorithm rankings I am aware of list both compares and 
swaps, because which one has the biggest effect on computation depends 
on the data (not its the ordering, but the complexity of comparison) and 
how it is stored (all in a single page of memory vs across multiple 
networked disks vs in immutable memory such that each swap actually 
duplicate the whole dataset).

Saying that one is always more significant than the other is far too 
much of an oversimplification.

A...