public final class IntQuickSort extends Object
IntQuickSort 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.
  • Method Details

    • sort

      public static void sort(int[] array, int left, int right, IntComparator comparator)