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
..
io	Merge pull request #84 from dscho/random-access-file	2013-10-21 09:38:44 -07:00
lang	Add the Method#isVarArgs method	2013-10-25 15:32:33 -05:00
math	update copyright years	2013-07-02 20:52:38 -06:00
net	update copyright years	2013-07-02 20:52:38 -06:00
nio	Add the FileChannel class	2013-10-21 10:59:59 -05:00
security	update copyright years	2013-07-02 20:52:38 -06:00
text	Implement a minimal SimpleDateFormat	2013-10-21 10:41:40 -05:00
util	Replace Arrays.sort() with an efficient sort algorithm	2013-11-04 00:27:04 -06:00