org.eclipse.collections.impl.utility.primitive

Class ByteQuickSort

java.lang.Object

org.eclipse.collections.impl.utility.primitive.ByteQuickSort

public final class ByteQuickSort
extends Object

ByteQuickSort 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 Summary

Modifier and Type	Method and Description
static void	sort(byte[] array, int left, int right, ByteComparator comparator)

Methods inherited from class java.lang.Object

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

Method Detail

sort

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