Class QuickSort_S32

java.lang.Object
org.ddogleg.sorting.QuickSort_S32

public class QuickSort_S32
extends Object
An implementation of the quick sort algorithm from Numerical Recipes Third Edition that is specified for arrays of doubles. A small amount of memory is declared for this sorting algorithm. This implementation seems to often perform slower than Shell sort. A comment in Numerical recipes about unnecessary array checks makes me think this is slow because java always does a bounds check on arrays. This has slightly better performance than Arrays.sort(double[]). Not noticeable in most applications.
  • Constructor Details

    • QuickSort_S32

      public QuickSort_S32()
    • QuickSort_S32

      public QuickSort_S32​(int NSTACK, int M)
  • Method Details

    • sort

      public void sort​(int[] arr, int length)
    • sort

      public void sort​(int[] arr, int offset, int length, int[] indexes)
    • sort

      public <T> void sort​(int[] arr, int length, List<T> list)
      Sorts the array and modifies the order in the list the same way