Johannes Schindelin 605701e40a Replace Arrays.sort() with an efficient sort algorithm
This change reuses the existing insertion sort (which was previously what
Arrays.sort() executed) in a full intro sort pipeline.

The implementation is based on the Musser paper on intro sort (Musser,
David R. "Introspective sorting and selection algorithms." Softw., Pract.
Exper. 27.8 (1997): 983-993.) and Wikipedia's current description of the
heap sort: http://en.wikipedia.org/wiki/Heapsort.

Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
2013-11-04 00:27:04 -06:00
..
2011-03-15 17:51:32 -06:00
2012-08-11 08:01:44 -06:00
2013-10-21 10:41:40 -05:00
2012-12-20 09:05:30 -07:00
2012-12-20 09:05:30 -07:00
2011-11-03 12:30:51 -06:00
2008-11-02 15:25:51 -07:00
2011-01-20 09:39:16 -07:00