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
..
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-10-21 13:34:33 -05:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-11-04 00:27:04 -06:00
2013-07-02 20:52:38 -06:00
2013-10-18 14:58:44 -05:00
2013-07-02 20:52:38 -06:00
2013-10-25 15:32:33 -05:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2012-07-06 23:47:42 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2011-09-29 18:27:34 -06:00
2013-10-25 15:32:33 -05:00
2013-07-02 20:52:38 -06:00