Package org.ejml.ops

Class QuickSort_S32

  • public class QuickSort_S32
extends java.lang.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.

    • Method Summary

      All Methods Instance Methods Concrete Methods 
      Modifier and Type Method Description
      void sort​(int[] arr, int length, int[] indexes)  

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

    • Constructor Detail

      • QuickSort_S32

        public QuickSort_S32()

      • QuickSort_S32

        public QuickSort_S32​(int NSTACK,
                     int M)

    • Method Detail

      • sort

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