Class InPlaceMergeSorter

  • 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 binary sort.

    This algorithm is stable. It's especially suited to sorting small lists where we'd rather optimize for avoiding allocating memory for this task. It performs well on lists that are already sorted.

    NOTE: This API is for internal purposes only and might change in incompatible ways in the next release.
    • Constructor Detail

    • Method Detail

      • sort

        public final void sort​(int from,
                               int to)
        Description copied from class: Sorter
        Sort the slice which starts at from (inclusive) and ends at to (exclusive).
        Specified by:
        sort in class Sorter