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
..
avian	update copyright years	2013-07-02 20:52:38 -06:00
java	Replace Arrays.sort() with an efficient sort algorithm	2013-11-04 00:27:04 -06:00
sun	update copyright years	2013-07-02 20:52:38 -06:00
java-io.cpp	fix darwin build	2013-10-24 14:07:53 -06:00
java-lang.cpp	fix ios sim=true build	2013-09-03 21:22:34 -06:00
java-net.cpp	update copyright years	2013-07-02 20:52:38 -06:00
java-nio.cpp	update copyright years	2013-07-02 20:52:38 -06:00
java-util-zip.cpp	update copyright years	2013-07-02 20:52:38 -06:00
java-util.cpp	update copyright years	2013-07-02 20:52:38 -06:00
jni-util.h	update copyright years	2013-07-02 20:52:38 -06:00