java-merge-sort
java-merge-sort copied to clipboard
Basic stand-alone disk-based N-way merge sort component for Java
Greetings! I am using the library and really like it. Very flexible and performs quite well. However... there's always room for optimization. I noticed that the activity on this project...
I would like a way to enhance the sort or merge process that allows removing duplicate values from the input. For example, if my input is: a, b, c, b,...
For a k-way merge with k>2 consider using a PriorityQueue instead of multiple 2-way mergers for enhanced performance.
Suggestion: It might be worthwhile to parallelize the main memory sort phase for better performance. For example, using jsr166y an array can be sorted in parallel simply like this: ParallelArray.createUsingHandoff(Object[],...
Currently there is no support for estimating sortable entry lengths. It would be nice to have helper object to use for calculating object sizes: this can use conservative estimates, like:...