Method Detail

• binarySearchFromTo

  public static int binarySearchFromTo(byte[] list,
                                       byte key,
                                       int from,
                                       int to)

  Searches the list for the specified value using the binary search algorithm. The list must must be sorted (as by the sort method) prior to making this call. If it is not sorted, the results are undefined: in particular, the call may enter an infinite loop. If the list contains multiple elements equal to the specified key, there is no guarantee which of the multiple elements will be found.

  Parameters:

  list - the list to be searched.

  key - the value to be searched for.

  from - the leftmost search position, inclusive.

  to - the rightmost search position, inclusive.

  Returns:

  index of the search key, if it is contained in the list; otherwise, (-(insertion point) - 1). The insertion point is defined as the the point at which the value would be inserted into the list: the index of the first element greater than the key, or list.length, if all elements in the list are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.

  See Also:

  Arrays

• binarySearchFromTo

  public static int binarySearchFromTo(char[] list,
                                       char key,
                                       int from,
                                       int to)

  Searches the list for the specified value using the binary search algorithm. The list must must be sorted (as by the sort method) prior to making this call. If it is not sorted, the results are undefined: in particular, the call may enter an infinite loop. If the list contains multiple elements equal to the specified key, there is no guarantee which of the multiple elements will be found.

  Parameters:

  list - the list to be searched.

  key - the value to be searched for.

  from - the leftmost search position, inclusive.

  to - the rightmost search position, inclusive.

  Returns:

  index of the search key, if it is contained in the list; otherwise, (-(insertion point) - 1). The insertion point is defined as the the point at which the value would be inserted into the list: the index of the first element greater than the key, or list.length, if all elements in the list are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.

  See Also:

  Arrays

• binarySearchFromTo

  public static int binarySearchFromTo(double[] list,
                                       double key,
                                       int from,
                                       int to)

  Searches the list for the specified value using the binary search algorithm. The list must must be sorted (as by the sort method) prior to making this call. If it is not sorted, the results are undefined: in particular, the call may enter an infinite loop. If the list contains multiple elements equal to the specified key, there is no guarantee which of the multiple elements will be found.

  Parameters:

  list - the list to be searched.

  key - the value to be searched for.

  from - the leftmost search position, inclusive.

  to - the rightmost search position, inclusive.

  Returns:

  index of the search key, if it is contained in the list; otherwise, (-(insertion point) - 1). The insertion point is defined as the the point at which the value would be inserted into the list: the index of the first element greater than the key, or list.length, if all elements in the list are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.

  See Also:

  Arrays

• binarySearchFromTo

  public static int binarySearchFromTo(float[] list,
                                       float key,
                                       int from,
                                       int to)

  Searches the list for the specified value using the binary search algorithm. The list must must be sorted (as by the sort method) prior to making this call. If it is not sorted, the results are undefined: in particular, the call may enter an infinite loop. If the list contains multiple elements equal to the specified key, there is no guarantee which of the multiple elements will be found.

  Parameters:

  list - the list to be searched.

  key - the value to be searched for.

  from - the leftmost search position, inclusive.

  to - the rightmost search position, inclusive.

  Returns:

  index of the search key, if it is contained in the list; otherwise, (-(insertion point) - 1). The insertion point is defined as the the point at which the value would be inserted into the list: the index of the first element greater than the key, or list.length, if all elements in the list are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.

  See Also:

  Arrays

• binarySearchFromTo

  public static int binarySearchFromTo(int[] list,
                                       int key,
                                       int from,
                                       int to)

  Searches the list for the specified value using the binary search algorithm. The list must must be sorted (as by the sort method) prior to making this call. If it is not sorted, the results are undefined: in particular, the call may enter an infinite loop. If the list contains multiple elements equal to the specified key, there is no guarantee which of the multiple elements will be found.

  Parameters:

  list - the list to be searched.

  key - the value to be searched for.

  from - the leftmost search position, inclusive.

  to - the rightmost search position, inclusive.

  Returns:

  index of the search key, if it is contained in the list; otherwise, (-(insertion point) - 1). The insertion point is defined as the the point at which the value would be inserted into the list: the index of the first element greater than the key, or list.length, if all elements in the list are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.

  See Also:

  Arrays

• binarySearchFromTo

  public static int binarySearchFromTo(long[] list,
                                       long key,
                                       int from,
                                       int to)

  Searches the list for the specified value using the binary search algorithm. The list must must be sorted (as by the sort method) prior to making this call. If it is not sorted, the results are undefined: in particular, the call may enter an infinite loop. If the list contains multiple elements equal to the specified key, there is no guarantee which of the multiple elements will be found.

  Parameters:

  list - the list to be searched.

  key - the value to be searched for.

  from - the leftmost search position, inclusive.

  to - the rightmost search position, inclusive.

  Returns:

  index of the search key, if it is contained in the list; otherwise, (-(insertion point) - 1). The insertion point is defined as the the point at which the value would be inserted into the list: the index of the first element greater than the key, or list.length, if all elements in the list are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.

  See Also:

  Arrays

• binarySearchFromTo

  public static int binarySearchFromTo(Object[] list,
                                       Object key,
                                       int from,
                                       int to,
                                       Comparator comparator)

  Searches the list for the specified value using the binary search algorithm. The list must be sorted into ascending order according to the specified comparator. All elements in the range must be mutually comparable by the specified comparator (that is, c.compare(e1, e2) must not throw a ClassCastException for any elements e1 and e2 in the range).

  If the list is not sorted, the results are undefined: in particular, the call may enter an infinite loop. If the list contains multiple elements equal to the specified key, there is no guarantee which instance will be found.

  Parameters:

  list - the list to be searched.

  key - the value to be searched for.

  from - the leftmost search position, inclusive.

  to - the rightmost search position, inclusive.

  comparator - the comparator by which the list is sorted.

  Returns:

  index of the search key, if it is contained in the list; otherwise, (-(insertion point) - 1). The insertion point is defined as the the point at which the value would be inserted into the list: the index of the first element greater than the key, or list.length, if all elements in the list are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.

  Throws:

  ClassCastException - if the list contains elements that are not mutually comparable using the specified comparator.

  See Also:

  Arrays, Comparator

• binarySearchFromTo

  public static int binarySearchFromTo(short[] list,
                                       short key,
                                       int from,
                                       int to)

  Searches the list for the specified value using the binary search algorithm. The list must must be sorted (as by the sort method) prior to making this call. If it is not sorted, the results are undefined: in particular, the call may enter an infinite loop. If the list contains multiple elements equal to the specified key, there is no guarantee which of the multiple elements will be found.

  Parameters:

  list - the list to be searched.

  key - the value to be searched for.

  from - the leftmost search position, inclusive.

  to - the rightmost search position, inclusive.

  Returns:

  index of the search key, if it is contained in the list; otherwise, (-(insertion point) - 1). The insertion point is defined as the the point at which the value would be inserted into the list: the index of the first element greater than the key, or list.length, if all elements in the list are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.

  See Also:

  Arrays

• binarySearchFromTo

  public static int binarySearchFromTo(int from,
                                       int to,
                                       IntComparator comp)

  Generically searches the list for the specified value using the binary search algorithm. The list must must be sorted (as by the sort method) prior to making this call. If it is not sorted, the results are undefined: in particular, the call may enter an infinite loop. If the list contains multiple elements equal to the specified key, there is no guarantee which of the multiple elements will be found.

  Parameters:

  list - the list to be searched.

  key - the value to be searched for.

  from - the leftmost search position, inclusive.

  to - the rightmost search position, inclusive.

  Returns:

  index of the search key, if it is contained in the list; otherwise, (-(insertion point) - 1). The insertion point is defined as the the point at which the value would be inserted into the list: the index of the first element greater than the key, or list.length, if all elements in the list are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.

  See Also:

  Arrays

• mergeSort

  public static void mergeSort(byte[] a,
                               int fromIndex,
                               int toIndex)

  Sorts the specified range of the specified array of elements.

  This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.

  The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n*log(n) performance, and can approach linear performance on nearly sorted lists.

  Parameters:

  a - the array to be sorted.

  fromIndex - the index of the first element (inclusive) to be sorted.

  toIndex - the index of the last element (exclusive) to be sorted.

  Throws:

  IllegalArgumentException - if fromIndex > toIndex

  ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length

• mergeSort

  public static void mergeSort(byte[] a,
                               int fromIndex,
                               int toIndex,
                               ByteComparator c)

  Sorts the specified range of the specified array of elements according to the order induced by the specified comparator. All elements in the range must be mutually comparable by the specified comparator (that is, c.compare(e1, e2) must not throw a ClassCastException for any elements e1 and e2 in the range).

  This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.

  The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n*log(n) performance, and can approach linear performance on nearly sorted lists.

  Parameters:

  a - the array to be sorted.

  fromIndex - the index of the first element (inclusive) to be sorted.

  toIndex - the index of the last element (exclusive) to be sorted.

  c - the comparator to determine the order of the array.

  Throws:

  ClassCastException - if the array contains elements that are not mutually comparable using the specified comparator.

  IllegalArgumentException - if fromIndex > toIndex

  ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length

  See Also:

  Comparator

• mergeSort

  public static void mergeSort(char[] a,
                               int fromIndex,
                               int toIndex)

  Sorts the specified range of the specified array of elements.

  This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.

  The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n*log(n) performance, and can approach linear performance on nearly sorted lists.

  Parameters:

  a - the array to be sorted.

  fromIndex - the index of the first element (inclusive) to be sorted.

  toIndex - the index of the last element (exclusive) to be sorted.

  Throws:

  IllegalArgumentException - if fromIndex > toIndex

  ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length

• mergeSort

  public static void mergeSort(char[] a,
                               int fromIndex,
                               int toIndex,
                               CharComparator c)

  Sorts the specified range of the specified array of elements according to the order induced by the specified comparator. All elements in the range must be mutually comparable by the specified comparator (that is, c.compare(e1, e2) must not throw a ClassCastException for any elements e1 and e2 in the range).

  This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.

  The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n*log(n) performance, and can approach linear performance on nearly sorted lists.

  Parameters:

  a - the array to be sorted.

  fromIndex - the index of the first element (inclusive) to be sorted.

  toIndex - the index of the last element (exclusive) to be sorted.

  c - the comparator to determine the order of the array.

  Throws:

  ClassCastException - if the array contains elements that are not mutually comparable using the specified comparator.

  IllegalArgumentException - if fromIndex > toIndex

  ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length

  See Also:

  Comparator

• mergeSort

  public static void mergeSort(double[] a,
                               int fromIndex,
                               int toIndex)

  Sorts the specified range of the specified array of elements.

  This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.

  The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n*log(n) performance, and can approach linear performance on nearly sorted lists.

  Parameters:

  a - the array to be sorted.

  fromIndex - the index of the first element (inclusive) to be sorted.

  toIndex - the index of the last element (exclusive) to be sorted.

  Throws:

  IllegalArgumentException - if fromIndex > toIndex

  ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length

• mergeSort

  public static void mergeSort(double[] a,
                               int fromIndex,
                               int toIndex,
                               DoubleComparator c)

  Sorts the specified range of the specified array of elements according to the order induced by the specified comparator. All elements in the range must be mutually comparable by the specified comparator (that is, c.compare(e1, e2) must not throw a ClassCastException for any elements e1 and e2 in the range).

  This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.

  The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n*log(n) performance, and can approach linear performance on nearly sorted lists.

  Parameters:

  a - the array to be sorted.

  fromIndex - the index of the first element (inclusive) to be sorted.

  toIndex - the index of the last element (exclusive) to be sorted.

  c - the comparator to determine the order of the array.

  Throws:

  ClassCastException - if the array contains elements that are not mutually comparable using the specified comparator.

  IllegalArgumentException - if fromIndex > toIndex

  ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length

  See Also:

  Comparator

• mergeSort

  public static void mergeSort(float[] a,
                               int fromIndex,
                               int toIndex)

  Sorts the specified range of the specified array of elements.

  This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.

  The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n*log(n) performance, and can approach linear performance on nearly sorted lists.

  Parameters:

  a - the array to be sorted.

  fromIndex - the index of the first element (inclusive) to be sorted.

  toIndex - the index of the last element (exclusive) to be sorted.

  Throws:

  IllegalArgumentException - if fromIndex > toIndex

  ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length

• mergeSort

  public static void mergeSort(float[] a,
                               int fromIndex,
                               int toIndex,
                               FloatComparator c)

  Sorts the specified range of the specified array of elements according to the order induced by the specified comparator. All elements in the range must be mutually comparable by the specified comparator (that is, c.compare(e1, e2) must not throw a ClassCastException for any elements e1 and e2 in the range).

  This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.

  The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n*log(n) performance, and can approach linear performance on nearly sorted lists.

  Parameters:

  a - the array to be sorted.

  fromIndex - the index of the first element (inclusive) to be sorted.

  toIndex - the index of the last element (exclusive) to be sorted.

  c - the comparator to determine the order of the array.

  Throws:

  ClassCastException - if the array contains elements that are not mutually comparable using the specified comparator.

  IllegalArgumentException - if fromIndex > toIndex

  ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length

  See Also:

  Comparator

• mergeSort

  public static void mergeSort(int[] a,
                               int fromIndex,
                               int toIndex)

  Sorts the specified range of the specified array of elements.

  This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.

  The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n*log(n) performance, and can approach linear performance on nearly sorted lists.

  Parameters:

  a - the array to be sorted.

  fromIndex - the index of the first element (inclusive) to be sorted.

  toIndex - the index of the last element (exclusive) to be sorted.

  Throws:

  IllegalArgumentException - if fromIndex > toIndex

  ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length

• mergeSort

  public static void mergeSort(int[] a,
                               int fromIndex,
                               int toIndex,
                               IntComparator c)

  Sorts the specified range of the specified array of elements according to the order induced by the specified comparator. All elements in the range must be mutually comparable by the specified comparator (that is, c.compare(e1, e2) must not throw a ClassCastException for any elements e1 and e2 in the range).

  This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.

  The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n*log(n) performance, and can approach linear performance on nearly sorted lists.

  Parameters:

  a - the array to be sorted.

  fromIndex - the index of the first element (inclusive) to be sorted.

  toIndex - the index of the last element (exclusive) to be sorted.

  c - the comparator to determine the order of the array.

  Throws:

  ClassCastException - if the array contains elements that are not mutually comparable using the specified comparator.

  IllegalArgumentException - if fromIndex > toIndex

  ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length

  See Also:

  Comparator

• mergeSort

  public static void mergeSort(long[] a,
                               int fromIndex,
                               int toIndex)

  Sorts the specified range of the specified array of elements.

  This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.

  The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n*log(n) performance, and can approach linear performance on nearly sorted lists.

  Parameters:

  a - the array to be sorted.

  fromIndex - the index of the first element (inclusive) to be sorted.

  toIndex - the index of the last element (exclusive) to be sorted.

  Throws:

  IllegalArgumentException - if fromIndex > toIndex

  ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length

• mergeSort

  public static void mergeSort(long[] a,
                               int fromIndex,
                               int toIndex,
                               LongComparator c)

  Sorts the specified range of the specified array of elements according to the order induced by the specified comparator. All elements in the range must be mutually comparable by the specified comparator (that is, c.compare(e1, e2) must not throw a ClassCastException for any elements e1 and e2 in the range).

  This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.

  The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n*log(n) performance, and can approach linear performance on nearly sorted lists.

  Parameters:

  a - the array to be sorted.

  fromIndex - the index of the first element (inclusive) to be sorted.

  toIndex - the index of the last element (exclusive) to be sorted.

  c - the comparator to determine the order of the array.

  Throws:

  ClassCastException - if the array contains elements that are not mutually comparable using the specified comparator.

  IllegalArgumentException - if fromIndex > toIndex

  ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length

  See Also:

  Comparator

• mergeSort

  public static void mergeSort(short[] a,
                               int fromIndex,
                               int toIndex)

  Sorts the specified range of the specified array of elements.

  This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.

  The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n*log(n) performance, and can approach linear performance on nearly sorted lists.

  Parameters:

  a - the array to be sorted.

  fromIndex - the index of the first element (inclusive) to be sorted.

  toIndex - the index of the last element (exclusive) to be sorted.

  Throws:

  IllegalArgumentException - if fromIndex > toIndex

  ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length

• mergeSort

  public static void mergeSort(short[] a,
                               int fromIndex,
                               int toIndex,
                               ShortComparator c)

  Sorts the specified range of the specified array of elements according to the order induced by the specified comparator. All elements in the range must be mutually comparable by the specified comparator (that is, c.compare(e1, e2) must not throw a ClassCastException for any elements e1 and e2 in the range).

  This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.

  The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n*log(n) performance, and can approach linear performance on nearly sorted lists.

  Parameters:

  a - the array to be sorted.

  fromIndex - the index of the first element (inclusive) to be sorted.

  toIndex - the index of the last element (exclusive) to be sorted.

  c - the comparator to determine the order of the array.

  Throws:

  ClassCastException - if the array contains elements that are not mutually comparable using the specified comparator.

  IllegalArgumentException - if fromIndex > toIndex

  ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length

  See Also:

  Comparator

• mergeSortInPlace

  public static void mergeSortInPlace(int[] a,
                                      int fromIndex,
                                      int toIndex)

  Sorts the specified range of the specified array of elements.

  This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.

  The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n*log(n) performance, and can approach linear performance on nearly sorted lists.

  Parameters:

  a - the array to be sorted.

  fromIndex - the index of the first element (inclusive) to be sorted.

  toIndex - the index of the last element (exclusive) to be sorted.

  Throws:

  IllegalArgumentException - if fromIndex > toIndex

  ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length

• quickSort

  public static void quickSort(byte[] a,
                               int fromIndex,
                               int toIndex,
                               ByteComparator c)

  Sorts the specified range of the specified array of elements according to the order induced by the specified comparator. All elements in the range must be mutually comparable by the specified comparator (that is, c.compare(e1, e2) must not throw a ClassCastException for any elements e1 and e2 in the range).

  The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.

  Parameters:

  a - the array to be sorted.

  fromIndex - the index of the first element (inclusive) to be sorted.

  toIndex - the index of the last element (exclusive) to be sorted.

  c - the comparator to determine the order of the array.

  Throws:

  ClassCastException - if the array contains elements that are not mutually comparable using the specified comparator.

  IllegalArgumentException - if fromIndex > toIndex

  ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length

  See Also:

  Comparator

• quickSort

  public static void quickSort(char[] a,
                               int fromIndex,
                               int toIndex,
                               CharComparator c)

  Sorts the specified range of the specified array of elements according to the order induced by the specified comparator. All elements in the range must be mutually comparable by the specified comparator (that is, c.compare(e1, e2) must not throw a ClassCastException for any elements e1 and e2 in the range).

  The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.

  Parameters:

  a - the array to be sorted.

  fromIndex - the index of the first element (inclusive) to be sorted.

  toIndex - the index of the last element (exclusive) to be sorted.

  c - the comparator to determine the order of the array.

  Throws:

  ClassCastException - if the array contains elements that are not mutually comparable using the specified comparator.

  IllegalArgumentException - if fromIndex > toIndex

  ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length

  See Also:

  Comparator

• quickSort

  public static void quickSort(double[] a,
                               int fromIndex,
                               int toIndex,
                               DoubleComparator c)

  Sorts the specified range of the specified array of elements according to the order induced by the specified comparator. All elements in the range must be mutually comparable by the specified comparator (that is, c.compare(e1, e2) must not throw a ClassCastException for any elements e1 and e2 in the range).

  The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.

  Parameters:

  a - the array to be sorted.

  fromIndex - the index of the first element (inclusive) to be sorted.

  toIndex - the index of the last element (exclusive) to be sorted.

  c - the comparator to determine the order of the array.

  Throws:

  ClassCastException - if the array contains elements that are not mutually comparable using the specified comparator.

  IllegalArgumentException - if fromIndex > toIndex

  ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length

  See Also:

  Comparator

• quickSort

  public static void quickSort(float[] a,
                               int fromIndex,
                               int toIndex,
                               FloatComparator c)

  Sorts the specified range of the specified array of elements according to the order induced by the specified comparator. All elements in the range must be mutually comparable by the specified comparator (that is, c.compare(e1, e2) must not throw a ClassCastException for any elements e1 and e2 in the range).

  The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.

  Parameters:

  a - the array to be sorted.

  fromIndex - the index of the first element (inclusive) to be sorted.

  toIndex - the index of the last element (exclusive) to be sorted.

  c - the comparator to determine the order of the array.

  Throws:

  ClassCastException - if the array contains elements that are not mutually comparable using the specified comparator.

  IllegalArgumentException - if fromIndex > toIndex

  ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length

  See Also:

  Comparator

• quickSort

  public static void quickSort(int[] a,
                               int fromIndex,
                               int toIndex,
                               IntComparator c)

  Sorts the specified range of the specified array of elements according to the order induced by the specified comparator. All elements in the range must be mutually comparable by the specified comparator (that is, c.compare(e1, e2) must not throw a ClassCastException for any elements e1 and e2 in the range).

  The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.

  Parameters:

  a - the array to be sorted.

  fromIndex - the index of the first element (inclusive) to be sorted.

  toIndex - the index of the last element (exclusive) to be sorted.

  c - the comparator to determine the order of the array.

  Throws:

  ClassCastException - if the array contains elements that are not mutually comparable using the specified comparator.

  IllegalArgumentException - if fromIndex > toIndex

  ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length

  See Also:

  Comparator

• quickSort

  public static void quickSort(long[] a,
                               int fromIndex,
                               int toIndex,
                               LongComparator c)

  Sorts the specified range of the specified array of elements according to the order induced by the specified comparator. All elements in the range must be mutually comparable by the specified comparator (that is, c.compare(e1, e2) must not throw a ClassCastException for any elements e1 and e2 in the range).

  The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.

  Parameters:

  a - the array to be sorted.

  fromIndex - the index of the first element (inclusive) to be sorted.

  toIndex - the index of the last element (exclusive) to be sorted.

  c - the comparator to determine the order of the array.

  Throws:

  ClassCastException - if the array contains elements that are not mutually comparable using the specified comparator.

  IllegalArgumentException - if fromIndex > toIndex

  ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length

  See Also:

  Comparator

• quickSort

  public static void quickSort(Object[] a)

  Sorts the specified range of the receiver into ascending order, according to the natural ordering of its elements. All elements in this range must implement the Comparable interface. Furthermore, all elements in this range must be mutually comparable (that is, e1.compareTo(e2) must not throw a ClassCastException for any elements e1 and e2 in the array).

  The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.

  Parameters:

  a - the array to be sorted.

• quickSort

  public static void quickSort(Object[] a,
                               int fromIndex,
                               int toIndex)

  Sorts the specified range of the receiver into ascending order, according to the natural ordering of its elements. All elements in this range must implement the Comparable interface. Furthermore, all elements in this range must be mutually comparable (that is, e1.compareTo(e2) must not throw a ClassCastException for any elements e1 and e2 in the array).

  Parameters:

  a - the array to be sorted.

  fromIndex - the index of the first element (inclusive) to be sorted.

  toIndex - the index of the last element (exclusive) to be sorted.

  Throws:

  IllegalArgumentException - if fromIndex > toIndex

  ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length

• quickSort

  public static void quickSort(Object[] a,
                               int fromIndex,
                               int toIndex,
                               Comparator c)

  Sorts the specified range of the specified array according to the order induced by the specified comparator. All elements in the range must be mutually comparable by the specified comparator (that is, c.compare(e1, e2) must not throw a ClassCastException for any elements e1 and e2 in the range).

  The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.

  Parameters:

  a - the array to be sorted.

  fromIndex - the index of the first element (inclusive) to be sorted.

  toIndex - the index of the last element (exclusive) to be sorted.

  c - the comparator to determine the order of the receiver.

  Throws:

  ClassCastException - if the array contains elements that are not mutually comparable using the specified comparator.

  IllegalArgumentException - if fromIndex > toIndex

  ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length

  See Also:

  Comparator

• quickSort

  public static void quickSort(Object[] a,
                               Comparator c)

  Sorts the specified array according to the order induced by the specified comparator. All elements in the range must be mutually comparable by the specified comparator (that is, c.compare(e1, e2) must not throw a ClassCastException for any elements e1 and e2 in the range).

  The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.

  Parameters:

  a - the array to be sorted.

  c - the comparator to determine the order of the receiver.

  Throws:

  ClassCastException - if the array contains elements that are not mutually comparable using the specified comparator.

  IllegalArgumentException - if fromIndex > toIndex

  ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length

  See Also:

  Comparator

• quickSort

  public static void quickSort(short[] a,
                               int fromIndex,
                               int toIndex,
                               ShortComparator c)

  Sorts the specified range of the specified array of elements according to the order induced by the specified comparator. All elements in the range must be mutually comparable by the specified comparator (that is, c.compare(e1, e2) must not throw a ClassCastException for any elements e1 and e2 in the range).

  This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.

  The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n*log(n) performance, and can approach linear performance on nearly sorted lists.

  Parameters:

  a - the array to be sorted.

  fromIndex - the index of the first element (inclusive) to be sorted.

  toIndex - the index of the last element (exclusive) to be sorted.

  c - the comparator to determine the order of the array.

  Throws:

  ClassCastException - if the array contains elements that are not mutually comparable using the specified comparator.

  IllegalArgumentException - if fromIndex > toIndex

  ArrayIndexOutOfBoundsException - if fromIndex < 0 or toIndex > a.length

  See Also:

  Comparator