public abstract class InPlaceMergeSorter extends Sorter
Sorter
implementation based on the merge-sort algorithm that merges
in place (no extra memory will be allocated). Small arrays are sorted with
insertion sort.Constructor and Description |
---|
InPlaceMergeSorter()
Create a new
InPlaceMergeSorter |
Modifier and Type | Method and Description |
---|---|
void |
sort(int from,
int to)
Sort the slice which starts at
from (inclusive) and ends at
to (exclusive). |
public InPlaceMergeSorter()
InPlaceMergeSorter
Copyright © 2000-2014 Apache Software Foundation. All Rights Reserved.