Class DoubleQuickSort

java.lang.Object
org.eclipse.collections.impl.utility.primitive.DoubleQuickSort

public final class DoubleQuickSort extends Object
DoubleQuickSort is an implementation of the Quick Sort algorithm as described in Donald Knuth's TAOCP with some optimizations. It supports indirect array sorting based on primitive comparators and/or key values extracted from the array values if a sort order other thant the natural one of the array elements is required. This file was automatically generated from template file primitiveSort.stg.
  • Field Details

  • Constructor Details

    • DoubleQuickSort

      private DoubleQuickSort()
  • Method Details

    • sort

      public static void sort(double[] array, int left, int right, DoubleComparator comparator)
    • insertionSort

      private static void insertionSort(double[] array, int left, int right, DoubleComparator comparator)
    • swap

      private static void swap(double[] array, int i1, int i2)