IntArrays (Primitive-Collections 0.2.0 API)

java.lang.Object
- speiger.src.collections.ints.utils.IntArrays

public class IntArrays
extends java.lang.Object

A Helper class for Arrays

Field Summary

Fields
Modifier and Type	Field and Description
`static int`	`BASE_THRESHOLD` Default Limit for Insertion/Selection Sort
`static int[]`	`EMPTY_ARRAY` Empty Array Reference used for Uninitialized Collections
`static int`	`PARALLEL_THRESHOLD` Default Threshold for Multithreaded Sorting Algorythm options

Constructor Summary

Constructors
Constructor and Description

IntArrays()

Constructors
Constructor and Description
`IntArrays()`

Method Summary

All Methods Static Methods Concrete Methods
Modifier and Type	Method and Description
`static int[]`	`heapify(int[] data, int size, IntComparator comp)` Helper function to create a Heap out of an array.
`static void`	`insertionSort(int[] array)` Sorts an array according to the natural ascending order using InsertionSort,
`static void`	`insertionSort(int[] array, int length)` Sorts an array according to the natural ascending order using InsertionSort,
`static void`	`insertionSort(int[] array, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator using Insertion Sort,
`static void`	`insertionSort(int[] array, int from, int to)` Sorts an array according to the natural ascending order using InsertionSort,
`static void`	`insertionSort(int[] array, int length, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator using Insertion Sort,
`static void`	`insertionSort(int[] array, int from, int to, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator using Insertion Sort,
`static void`	`memFreeMergeSort(int[] array)` Sorts an array according to the natural ascending order using Memory Free Merge Sort, This implementation is inspired by FastUtil original merge sort, but without the need to allocate a copy of the original Array.
`static void`	`memFreeMergeSort(int[] array, int length)` Sorts an array according to the natural ascending order using Memory Free Merge Sort, This implementation is inspired by FastUtil original merge sort, but without the need to allocate a copy of the original Array.
`static void`	`memFreeMergeSort(int[] array, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator using Memory Free Merge Sort, This implementation is inspired by FastUtil original merge sort, but without the need to allocate a copy of the original Array.
`static void`	`memFreeMergeSort(int[] array, int from, int to)` Sorts an array according to the natural ascending order using Memory Free Merge Sort, This implementation is inspired by FastUtil original merge sort, but without the need to allocate a copy of the original Array.
`static void`	`memFreeMergeSort(int[] array, int length, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator using Memory Free Merge Sort, This implementation is inspired by FastUtil original merge sort, but without the need to allocate a copy of the original Array.
`static void`	`memFreeMergeSort(int[] array, int from, int to, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator using Memory Free Merge Sort, This implementation is inspired by FastUtil original merge sort, but without the need to allocate a copy of the original Array.
`static void`	`mergeSort(int[] array)` Sorts an array according to the natural ascending order using Merge Sort, This implementation was copied from FastUtil with a couple custom optimizations
`static void`	`mergeSort(int[] array, int length)` Sorts an array according to the natural ascending order using Merge Sort, This implementation was copied from FastUtil with a couple custom optimizations
`static void`	`mergeSort(int[] array, int[] supp, int from, int to)` Sorts an array according to the natural ascending order using Merge Sort, This implementation was copied from FastUtil with a couple custom optimizations
`static void`	`mergeSort(int[] array, int[] supp, int from, int to, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator using Merge Sort, This implementation was copied from FastUtil with a couple custom optimizations
`static void`	`mergeSort(int[] array, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator using Merge Sort, This implementation was copied from FastUtil with a couple custom optimizations
`static void`	`mergeSort(int[] array, int length, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator using Merge Sort, This implementation was copied from FastUtil with a couple custom optimizations
`static void`	`parallelMemFreeMergeSort(int[] array)` Sorts an array according to the natural ascending order using Parallel Memory Free Merge Sort, This implementation is inspired by FastUtil original merge sort, but without the need to allocate a copy of the original Array.
`static void`	`parallelMemFreeMergeSort(int[] array, int length)` Sorts an array according to the natural ascending order using Parallel Memory Free Merge Sort, This implementation is inspired by FastUtil original merge sort, but without the need to allocate a copy of the original Array.
`static void`	`parallelMemFreeMergeSort(int[] array, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator using Parallel Memory Free Merge Sort, This implementation is inspired by FastUtil original merge sort, but without the need to allocate a copy of the original Array.
`static void`	`parallelMemFreeMergeSort(int[] array, int from, int to)` Sorts an array according to the natural ascending order using Parallel Memory Free Merge Sort, This implementation is inspired by FastUtil original merge sort, but without the need to allocate a copy of the original Array.
`static void`	`parallelMemFreeMergeSort(int[] array, int length, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator using Parallel Memory Free Merge Sort, This implementation is inspired by FastUtil original merge sort, but without the need to allocate a copy of the original Array.
`static void`	`parallelMemFreeMergeSort(int[] array, int from, int to, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator using Parallel Memory Free Merge Sort, This implementation is inspired by FastUtil original merge sort, but without the need to allocate a copy of the original Array.
`static void`	`parallelMergeSort(int[] array)` Sorts an array according to the natural ascending order using Parallel Merge Sort, This implementation was copied from FastUtil with a couple custom optimizations
`static void`	`parallelMergeSort(int[] array, int length)` Sorts an array according to the natural ascending order using Parallel Merge Sort, This implementation was copied from FastUtil with a couple custom optimizations
`static void`	`parallelMergeSort(int[] array, int[] supp, int from, int to)` Sorts an array according to the natural ascending order using Parallel Merge Sort, This implementation was copied from FastUtil with a couple custom optimizations
`static void`	`parallelMergeSort(int[] array, int[] supp, int from, int to, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator using Parallel Merge Sort, This implementation was copied from FastUtil with a couple custom optimizations
`static void`	`parallelMergeSort(int[] array, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator using a Parallel Merge Sort, This implementation was copied from FastUtil with a couple custom optimizations
`static void`	`parallelMergeSort(int[] array, int length, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator using Parallel Merge Sort, This implementation was copied from FastUtil with a couple custom optimizations
`static void`	`parallelQuickSort(int[] array)` Sorts an array according to the natural ascending order using Parallel Quick Sort, This implementation is a custom of FastUtil quicksort but with a different code structure, and that sorting Algorithm is based on the tuned quicksort adapted from Jon L.
`static void`	`parallelQuickSort(int[] array, int length)` Sorts an array according to the natural ascending order using Parallel Quick Sort, This implementation is a custom of FastUtil quicksort but with a different code structure, and that sorting Algorithm is based on the tuned quicksort adapted from Jon L.
`static void`	`parallelQuickSort(int[] array, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator using Parallel Quick Sort, This implementation is a custom of FastUtil quicksort but with a different code structure, and that sorting Algorithm is based on the tuned quicksort adapted from Jon L.
`static void`	`parallelQuickSort(int[] array, int from, int to)` Sorts an array according to the natural ascending order using Parallel Quick Sort, This implementation is a custom of FastUtil quicksort but with a different code structure, and that sorting Algorithm is based on the tuned quicksort adapted from Jon L.
`static void`	`parallelQuickSort(int[] array, int length, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator using Parallel Quick Sort, This implementation is a custom of FastUtil quicksort but with a different code structure, and that sorting Algorithm is based on the tuned quicksort adapted from Jon L.
`static void`	`parallelQuickSort(int[] array, int from, int to, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator using Parallel Quick Sort, This implementation is a custom of FastUtil quicksort but with a different code structure, and that sorting Algorithm is based on the tuned quicksort adapted from Jon L.
`static void`	`quickSort(int[] array)` Sorts an array according to the natural ascending order using Quick Sort, This implementation is a custom of FastUtil quicksort but with a different code structure, and that sorting Algorithm is based on the tuned quicksort adapted from Jon L.
`static void`	`quickSort(int[] array, int length)` Sorts an array according to the natural ascending order using Quick Sort, This implementation is a custom of FastUtil quicksort but with a different code structure, and that sorting Algorithm is based on the tuned quicksort adapted from Jon L.
`static void`	`quickSort(int[] array, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator using Quick Sort, This implementation is a custom of FastUtil quicksort but with a different code structure, and that sorting Algorithm is based on the tuned quicksort adapted from Jon L.
`static void`	`quickSort(int[] array, int from, int to)` Sorts an array according to the natural ascending order using Quick Sort, This implementation is a custom of FastUtil quicksort but with a different code structure, and that sorting Algorithm is based on the tuned quicksort adapted from Jon L.
`static void`	`quickSort(int[] array, int length, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator using Quick Sort, This implementation is a custom of FastUtil quicksort but with a different code structure, and that sorting Algorithm is based on the tuned quicksort adapted from Jon L.
`static void`	`quickSort(int[] array, int from, int to, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator using Quick Sort, This implementation is a custom of FastUtil quicksort but with a different code structure, and that sorting Algorithm is based on the tuned quicksort adapted from Jon L.
`static void`	`selectionSort(int[] array)` Sorts an array according to the natural ascending order using Selection Sort,
`static void`	`selectionSort(int[] array, int length)` Sorts an array according to the natural ascending order using Selection Sort,
`static void`	`selectionSort(int[] array, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator using Selection Sort,
`static void`	`selectionSort(int[] array, int from, int to)` Sorts an array according to the natural ascending order using Selection Sort,
`static void`	`selectionSort(int[] array, int length, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator using Selection Sort,
`static void`	`selectionSort(int[] array, int from, int to, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator using Selection Sort,
`static int`	`shiftDown(int[] data, int size, int index, IntComparator comp)` Method to validate if the current value is the lowest value in the heap
`static int`	`shiftUp(int[] data, int index, IntComparator comp)` Method to sort a specific value into the heap.
`static int[]`	`shuffle(int[] array)` Simple Shuffle method for Arrays.
`static int[]`	`shuffle(int[] array, java.util.Random random)` Simple Shuffle method for Arrays.
`static void`	`stableSort(int[] array)` Sorts an array according to the natural ascending order, potentially dynamically choosing an appropriate algorithm given the type and size of the array.
`static void`	`stableSort(int[] array, int length)` Sorts an array according to the natural ascending order, potentially dynamically choosing an appropriate algorithm given the type and size of the array.
`static void`	`stableSort(int[] array, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator, potentially dynamically choosing an appropriate algorithm given the type and size of the array.
`static void`	`stableSort(int[] array, int from, int to)` Sorts an array according to the natural ascending order, potentially dynamically choosing an appropriate algorithm given the type and size of the array.
`static void`	`stableSort(int[] array, int length, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator, potentially dynamically choosing an appropriate algorithm given the type and size of the array.
`static void`	`stableSort(int[] array, int from, int to, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator, potentially dynamically choosing an appropriate algorithm given the type and size of the array.
`static void`	`unstableSort(int[] array)` Sorts an array according to the natural ascending order, potentially dynamically choosing an appropriate algorithm given the type and size of the array.
`static void`	`unstableSort(int[] array, int length)` Sorts an array according to the natural ascending order, potentially dynamically choosing an appropriate algorithm given the type and size of the array.
`static void`	`unstableSort(int[] array, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator, potentially dynamically choosing an appropriate algorithm given the type and size of the array.
`static void`	`unstableSort(int[] array, int from, int to)` Sorts an array according to the natural ascending order, potentially dynamically choosing an appropriate algorithm given the type and size of the array.
`static void`	`unstableSort(int[] array, int length, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator, potentially dynamically choosing an appropriate algorithm given the type and size of the array.
`static void`	`unstableSort(int[] array, int from, int to, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator, potentially dynamically choosing an appropriate algorithm given the type and size of the array.
`static int[]`	`unwrap(java.lang.Integer[] a)` A Helper function to convert a Integer Array to a int Array.
`static int[]`	`unwrap(java.lang.Integer[] a, int length)` A Helper function to convert a Integer Array to a int Array.
`static int[]`	`unwrap(java.lang.Integer[] a, int offset, int length)` A Helper function to convert a Integer Array to a int Array.
`static java.lang.Integer[]`	`wrap(int[] a)` A Helper function to convert a Primitive Array to a Integer Array.
`static java.lang.Integer[]`	`wrap(int[] a, int length)` A Helper function to convert a Primitive Array to a Integer Array.
`static java.lang.Integer[]`	`wrap(int[] a, int offset, int length)` A Helper function to convert a Primitive Array to a Integer Array.

Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Field Detail
  - BASE_THRESHOLD
```
public static final int BASE_THRESHOLD
```
    Default Limit for Insertion/Selection Sort
    
    See Also:
    
    Constant Field Values
  - PARALLEL_THRESHOLD
```
public static final int PARALLEL_THRESHOLD
```
    Default Threshold for Multithreaded Sorting Algorythm options
    
    See Also:
    
    Constant Field Values
  - EMPTY_ARRAY
```
public static final int[] EMPTY_ARRAY
```
    Empty Array Reference used for Uninitialized Collections
- Constructor Detail
  - IntArrays
```
public IntArrays()
```
- Method Detail
  - wrap
```
public static java.lang.Integer[] wrap(int[] a)
```
    A Helper function to convert a Primitive Array to a Integer Array.
    
    Parameters:
    
    a - the array that should be converted
    
    Returns:
    
    a Integer Array of the input array.
  - wrap
```
public static java.lang.Integer[] wrap(int[] a,
                                       int length)
```
    A Helper function to convert a Primitive Array to a Integer Array.
    
    Parameters:
    
    a - the array that should be converted
    
    length - the maximum length that should be coverted
    
    Returns:
    
    a Integer Array of the input array.
  - wrap
```
public static java.lang.Integer[] wrap(int[] a,
                                       int offset,
                                       int length)
```
    A Helper function to convert a Primitive Array to a Integer Array.
    
    Parameters:
    
    a - the array that should be converted
    
    offset - the starting offset of the inputarray
    
    length - the maximum length that should be coverted
    
    Returns:
    
    a Integer Array of the input array.
  - unwrap
```
public static int[] unwrap(java.lang.Integer[] a)
```
    A Helper function to convert a Integer Array to a int Array.
    
    Parameters:
    
    a - the array that should be converted
    
    Returns:
    
    a int Array of the input array.
  - unwrap
```
public static int[] unwrap(java.lang.Integer[] a,
                           int length)
```
    A Helper function to convert a Integer Array to a int Array.
    
    Parameters:
    
    a - the array that should be converted
    
    length - the maximum length that should be coverted
    
    Returns:
    
    a int Array of the input array.
  - unwrap
```
public static int[] unwrap(java.lang.Integer[] a,
                           int offset,
                           int length)
```
    A Helper function to convert a Integer Array to a int Array.
    
    Parameters:
    
    a - the array that should be converted
    
    offset - the starting offset of the inputarray
    
    length - the maximum length that should be coverted
    
    Returns:
    
    a int Array of the input array.
  - shiftDown
```
public static int shiftDown(int[] data,
                            int size,
                            int index,
                            IntComparator comp)
```
    Method to validate if the current value is the lowest value in the heap
    
    Parameters:
    
    data - the current heap.
    
    size - the size of the heap
    
    index - the index that should be validated
    
    comp - the comparator to sort the heap. Can be null
    
    Returns:
    
    the index the element was shifted to
  - shiftUp
```
public static int shiftUp(int[] data,
                          int index,
                          IntComparator comp)
```
    Method to sort a specific value into the heap.
    
    Parameters:
    
    data - the heap itself.
    
    index - that should be heapified.
    
    comp - the comparator to sort the heap. Can be null
    
    Returns:
    
    the index the element was shifted to
  - heapify
```
public static int[] heapify(int[] data,
                            int size,
                            IntComparator comp)
```
    Helper function to create a Heap out of an array.
    
    Parameters:
    
    data - the array to heapify
    
    size - the current size of elements within the array.
    
    comp - the Comparator to sort the array. Can be null
    
    Returns:
    
    the input array
  - shuffle
```
public static int[] shuffle(int[] array)
```
    Simple Shuffle method for Arrays.
    
    Parameters:
    
    array - the elements that should be shuffled
    
    Returns:
    
    the provided sorted array
    
    Note:
    
    This uses the SanityChecks#getRandom
  - shuffle
```
public static int[] shuffle(int[] array,
                            java.util.Random random)
```
    Simple Shuffle method for Arrays.
    
    Parameters:
    
    array - the elements that should be shuffled
    
    random - the Random Number Generator that should be used for the shuffling
    
    Returns:
    
    the provided sorted array
  - stableSort
```
public static void stableSort(int[] array,
                              IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator, potentially dynamically choosing an appropriate algorithm given the type and size of the array. Stable sort referres to Mergesort or Insertionsort
    
    Parameters:
    
    array - the array that needs to be sorted
    
    comp - the Comparator that decides the sorting order
  - stableSort
```
public static void stableSort(int[] array,
                              int length,
                              IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator, potentially dynamically choosing an appropriate algorithm given the type and size of the array. Stable sort referres to Mergesort or Insertionsort
    
    Parameters:
    
    array - the array that needs to be sorted
    
    length - the maxmium size of the array to be sorted
    
    comp - the Comparator that decides the sorting order
  - stableSort
```
public static void stableSort(int[] array,
                              int from,
                              int to,
                              IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator, potentially dynamically choosing an appropriate algorithm given the type and size of the array. Stable sort referres to Mergesort or Insertionsort
    
    Parameters:
    
    array - the array that needs to be sorted
    
    from - where the array should be sorted from
    
    to - where the array should be sorted to
    
    comp - the Comparator that decides the sorting order
  - stableSort
```
public static void stableSort(int[] array)
```
    Sorts an array according to the natural ascending order, potentially dynamically choosing an appropriate algorithm given the type and size of the array. Stable sort referres to Mergesort or Insertionsort
    
    Parameters:
    
    array - the array that needs to be sorted
  - stableSort
```
public static void stableSort(int[] array,
                              int length)
```
    Sorts an array according to the natural ascending order, potentially dynamically choosing an appropriate algorithm given the type and size of the array. Stable sort referres to Mergesort or Insertionsort
    
    Parameters:
    
    array - the array that needs to be sorted
    
    length - the maxmium size of the array to be sorted
  - stableSort
```
public static void stableSort(int[] array,
                              int from,
                              int to)
```
    Sorts an array according to the natural ascending order, potentially dynamically choosing an appropriate algorithm given the type and size of the array. Stable sort referres to Mergesort or Insertionsort
    
    Parameters:
    
    array - the array that needs to be sorted
    
    from - where the array should be sorted from
    
    to - where the array should be sorted to
  - unstableSort
```
public static void unstableSort(int[] array,
                                IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator, potentially dynamically choosing an appropriate algorithm given the type and size of the array. Unstable sort referres to QuickSort or SelectionSort
    
    Parameters:
    
    array - the array that needs to be sorted
    
    comp - the Comparator that decides the sorting order
  - unstableSort
```
public static void unstableSort(int[] array,
                                int length,
                                IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator, potentially dynamically choosing an appropriate algorithm given the type and size of the array. Unstable sort referres to QuickSort or SelectionSort
    
    Parameters:
    
    array - the array that needs to be sorted
    
    length - the maxmium size of the array to be sorted
    
    comp - the Comparator that decides the sorting order
  - unstableSort
```
public static void unstableSort(int[] array,
                                int from,
                                int to,
                                IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator, potentially dynamically choosing an appropriate algorithm given the type and size of the array. Unstable sort referres to QuickSort or SelectionSort
    
    Parameters:
    
    array - the array that needs to be sorted
    
    from - where the array should be sorted from
    
    to - where the array should be sorted to
    
    comp - the Comparator that decides the sorting order
  - unstableSort
```
public static void unstableSort(int[] array)
```
    Sorts an array according to the natural ascending order, potentially dynamically choosing an appropriate algorithm given the type and size of the array. Unstable sort referres to QuickSort or SelectionSort
    
    Parameters:
    
    array - the array that needs to be sorted
  - unstableSort
```
public static void unstableSort(int[] array,
                                int length)
```
    Sorts an array according to the natural ascending order, potentially dynamically choosing an appropriate algorithm given the type and size of the array. Unstable sort referres to QuickSort or SelectionSort
    
    Parameters:
    
    array - the array that needs to be sorted
    
    length - the maxmium size of the array to be sorted
  - unstableSort
```
public static void unstableSort(int[] array,
                                int from,
                                int to)
```
    Sorts an array according to the natural ascending order, potentially dynamically choosing an appropriate algorithm given the type and size of the array. Unstable sort referres to QuickSort or SelectionSort
    
    Parameters:
    
    array - the array that needs to be sorted
    
    from - where the array should be sorted from
    
    to - where the array should be sorted to
  - insertionSort
```
public static void insertionSort(int[] array,
                                 IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator using Insertion Sort,
    
    Parameters:
    
    array - the array that needs to be sorted
    
    comp - the Comparator that decides the sorting order
  - insertionSort
```
public static void insertionSort(int[] array,
                                 int length,
                                 IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator using Insertion Sort,
    
    Parameters:
    
    array - the array that needs to be sorted
    
    length - the maxmium size of the array to be sorted
    
    comp - the Comparator that decides the sorting order
  - insertionSort
```
public static void insertionSort(int[] array,
                                 int from,
                                 int to,
                                 IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator using Insertion Sort,
    
    Parameters:
    
    array - the array that needs to be sorted
    
    from - where the array should be sorted from
    
    to - where the array should be sorted to
    
    comp - the Comparator that decides the sorting order
  - insertionSort
```
public static void insertionSort(int[] array)
```
    Sorts an array according to the natural ascending order using InsertionSort,
    
    Parameters:
    
    array - the array that needs to be sorted
  - insertionSort
```
public static void insertionSort(int[] array,
                                 int length)
```
    Sorts an array according to the natural ascending order using InsertionSort,
    
    Parameters:
    
    array - the array that needs to be sorted
    
    length - the maxmium size of the array to be sorted
  - insertionSort
```
public static void insertionSort(int[] array,
                                 int from,
                                 int to)
```
    Sorts an array according to the natural ascending order using InsertionSort,
    
    Parameters:
    
    array - the array that needs to be sorted
    
    from - where the array should be sorted from
    
    to - where the array should be sorted to
  - selectionSort
```
public static void selectionSort(int[] array,
                                 IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator using Selection Sort,
    
    Parameters:
    
    array - the array that needs to be sorted
    
    comp - the Comparator that decides the sorting order
  - selectionSort
```
public static void selectionSort(int[] array,
                                 int length,
                                 IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator using Selection Sort,
    
    Parameters:
    
    array - the array that needs to be sorted
    
    length - the maxmium size of the array to be sorted
    
    comp - the Comparator that decides the sorting order
  - selectionSort
```
public static void selectionSort(int[] array,
                                 int from,
                                 int to,
                                 IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator using Selection Sort,
    
    Parameters:
    
    array - the array that needs to be sorted
    
    from - where the array should be sorted from
    
    to - where the array should be sorted to
    
    comp - the Comparator that decides the sorting order
  - selectionSort
```
public static void selectionSort(int[] array)
```
    Sorts an array according to the natural ascending order using Selection Sort,
    
    Parameters:
    
    array - the array that needs to be sorted
  - selectionSort
```
public static void selectionSort(int[] array,
                                 int length)
```
    Sorts an array according to the natural ascending order using Selection Sort,
    
    Parameters:
    
    array - the array that needs to be sorted
    
    length - the maxmium size of the array to be sorted
  - selectionSort
```
public static void selectionSort(int[] array,
                                 int from,
                                 int to)
```
    Sorts an array according to the natural ascending order using Selection Sort,
    
    Parameters:
    
    array - the array that needs to be sorted
    
    from - where the array should be sorted from
    
    to - where the array should be sorted to
  - mergeSort
```
public static void mergeSort(int[] array,
                             IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator using Merge Sort, This implementation was copied from FastUtil with a couple custom optimizations
    
    Parameters:
    
    array - the array that needs to be sorted
    
    comp - the Comparator that decides the sorting order
  - mergeSort
```
public static void mergeSort(int[] array,
                             int length,
                             IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator using Merge Sort, This implementation was copied from FastUtil with a couple custom optimizations
    
    Parameters:
    
    array - the array that needs to be sorted
    
    length - the maxmium size of the array to be sorted
    
    comp - the Comparator that decides the sorting order
  - mergeSort
```
public static void mergeSort(int[] array,
                             int[] supp,
                             int from,
                             int to,
                             IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator using Merge Sort, This implementation was copied from FastUtil with a couple custom optimizations
    
    Parameters:
    
    array - the array that needs to be sorted
    
    supp - the auxillary array that is used to simplify the sorting
    
    from - where the array should be sorted from
    
    to - where the array should be sorted to
    
    comp - the Comparator that decides the sorting order
  - mergeSort
```
public static void mergeSort(int[] array)
```
    Sorts an array according to the natural ascending order using Merge Sort, This implementation was copied from FastUtil with a couple custom optimizations
    
    Parameters:
    
    array - the array that needs to be sorted
  - mergeSort
```
public static void mergeSort(int[] array,
                             int length)
```
    Sorts an array according to the natural ascending order using Merge Sort, This implementation was copied from FastUtil with a couple custom optimizations
    
    Parameters:
    
    array - the array that needs to be sorted
    
    length - the maxmium size of the array to be sorted
  - mergeSort
```
public static void mergeSort(int[] array,
                             int[] supp,
                             int from,
                             int to)
```
    Sorts an array according to the natural ascending order using Merge Sort, This implementation was copied from FastUtil with a couple custom optimizations
    
    Parameters:
    
    array - the array that needs to be sorted
    
    supp - the auxillary array that is used to simplify the sorting
    
    from - where the array should be sorted from
    
    to - where the array should be sorted to
  - parallelMergeSort
```
public static void parallelMergeSort(int[] array,
                                     IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator using a Parallel Merge Sort, This implementation was copied from FastUtil with a couple custom optimizations
    
    Parameters:
    
    array - the array that needs to be sorted
    
    comp - the Comparator that decides the sorting order
    
    Note:
    
    This parallelization is invoked through SanityChecks.invokeTask(java.util.concurrent.ForkJoinTask<T>) which the threadpool can be changed as needed
  - parallelMergeSort
```
public static void parallelMergeSort(int[] array,
                                     int length,
                                     IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator using Parallel Merge Sort, This implementation was copied from FastUtil with a couple custom optimizations
    
    Parameters:
    
    array - the array that needs to be sorted
    
    length - the maxmium size of the array to be sorted
    
    comp - the Comparator that decides the sorting order
    
    Note:
    
    This parallelization is invoked through SanityChecks.invokeTask(java.util.concurrent.ForkJoinTask<T>) which the threadpool can be changed as needed
  - parallelMergeSort
```
public static void parallelMergeSort(int[] array,
                                     int[] supp,
                                     int from,
                                     int to,
                                     IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator using Parallel Merge Sort, This implementation was copied from FastUtil with a couple custom optimizations
    
    Parameters:
    
    array - the array that needs to be sorted
    
    supp - the auxillary array that is used to simplify the sorting
    
    from - where the array should be sorted from
    
    to - where the array should be sorted to
    
    comp - the Comparator that decides the sorting order
    
    Note:
    
    This parallelization is invoked through SanityChecks.invokeTask(java.util.concurrent.ForkJoinTask<T>) which the threadpool can be changed as needed
  - parallelMergeSort
```
public static void parallelMergeSort(int[] array)
```
    Sorts an array according to the natural ascending order using Parallel Merge Sort, This implementation was copied from FastUtil with a couple custom optimizations
    
    Parameters:
    
    array - the array that needs to be sorted
    
    Note:
    
    This parallelization is invoked through SanityChecks.invokeTask(java.util.concurrent.ForkJoinTask<T>) which the threadpool can be changed as needed
  - parallelMergeSort
```
public static void parallelMergeSort(int[] array,
                                     int length)
```
    Sorts an array according to the natural ascending order using Parallel Merge Sort, This implementation was copied from FastUtil with a couple custom optimizations
    
    Parameters:
    
    array - the array that needs to be sorted
    
    length - the maxmium size of the array to be sorted
    
    Note:
    
    This parallelization is invoked through SanityChecks.invokeTask(java.util.concurrent.ForkJoinTask<T>) which the threadpool can be changed as needed
  - parallelMergeSort
```
public static void parallelMergeSort(int[] array,
                                     int[] supp,
                                     int from,
                                     int to)
```
    Sorts an array according to the natural ascending order using Parallel Merge Sort, This implementation was copied from FastUtil with a couple custom optimizations
    
    Parameters:
    
    array - the array that needs to be sorted
    
    supp - the auxillary array that is used to simplify the sorting
    
    from - where the array should be sorted from
    
    to - where the array should be sorted to
    
    Note:
    
    This parallelization is invoked through SanityChecks.invokeTask(java.util.concurrent.ForkJoinTask<T>) which the threadpool can be changed as needed
  - memFreeMergeSort
```
public static void memFreeMergeSort(int[] array,
                                    IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator using Memory Free Merge Sort, This implementation is inspired by FastUtil original merge sort, but without the need to allocate a copy of the original Array. It is in Very Unsorted Instances 50% slower then Mergesort, otherwise it as fast.
    
    Parameters:
    
    array - the array that needs to be sorted
    
    comp - the Comparator that decides the sorting order
  - memFreeMergeSort
```
public static void memFreeMergeSort(int[] array,
                                    int length,
                                    IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator using Memory Free Merge Sort, This implementation is inspired by FastUtil original merge sort, but without the need to allocate a copy of the original Array. It is in Very Unsorted Instances 50% slower then Mergesort, otherwise it as fast.
    
    Parameters:
    
    array - the array that needs to be sorted
    
    length - the maxmium size of the array to be sorted
    
    comp - the Comparator that decides the sorting order
  - memFreeMergeSort
```
public static void memFreeMergeSort(int[] array,
                                    int from,
                                    int to,
                                    IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator using Memory Free Merge Sort, This implementation is inspired by FastUtil original merge sort, but without the need to allocate a copy of the original Array. It is in Very Unsorted Instances 50% slower then Mergesort, otherwise it as fast.
    
    Parameters:
    
    array - the array that needs to be sorted
    
    from - where the array should be sorted from
    
    to - where the array should be sorted to
    
    comp - the Comparator that decides the sorting order
  - memFreeMergeSort
```
public static void memFreeMergeSort(int[] array)
```
    Sorts an array according to the natural ascending order using Memory Free Merge Sort, This implementation is inspired by FastUtil original merge sort, but without the need to allocate a copy of the original Array. It is depending on the size and the unsorted level of the input array slower or almost as fast as normal merge sort. Depending on the test size i can be 0.5x slower (5000 elements) or 4x slower (50000 elements) under the assumtion that the array is in its worst case scenario. It does stack allocate tiny amounts of data for shifting around elements.
    
    Parameters:
    
    array - the array that needs to be sorted
  - memFreeMergeSort
```
public static void memFreeMergeSort(int[] array,
                                    int length)
```
    Sorts an array according to the natural ascending order using Memory Free Merge Sort, This implementation is inspired by FastUtil original merge sort, but without the need to allocate a copy of the original Array. It is depending on the size and the unsorted level of the input array slower or almost as fast as normal merge sort. Depending on the test size i can be 0.5x slower (5000 elements) or 4x slower (50000 elements) under the assumtion that the array is in its worst case scenario. It does stack allocate tiny amounts of data for shifting around elements.
    
    Parameters:
    
    array - the array that needs to be sorted
    
    length - the maxmium size of the array to be sorted
  - memFreeMergeSort
```
public static void memFreeMergeSort(int[] array,
                                    int from,
                                    int to)
```
    Sorts an array according to the natural ascending order using Memory Free Merge Sort, This implementation is inspired by FastUtil original merge sort, but without the need to allocate a copy of the original Array. It is depending on the size and the unsorted level of the input array slower or almost as fast as normal merge sort. Depending on the test size i can be 0.5x slower (5000 elements) or 4x slower (50000 elements) under the assumtion that the array is in its worst case scenario. It does stack allocate tiny amounts of data for shifting around elements.
    
    Parameters:
    
    array - the array that needs to be sorted
    
    from - where the array should be sorted from
    
    to - where the array should be sorted to
  - parallelMemFreeMergeSort
```
public static void parallelMemFreeMergeSort(int[] array,
                                            IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator using Parallel Memory Free Merge Sort, This implementation is inspired by FastUtil original merge sort, but without the need to allocate a copy of the original Array. It is depending on the size and the unsorted level of the input array slower or almost as fast as normal merge sort. Depending on the test size i can be 0.5x slower (5000 elements) or 4x slower (50000 elements) under the assumtion that the array is in its worst case scenario. It does stack allocate tiny amounts of data for shifting around elements.
    
    Parameters:
    
    array - the array that needs to be sorted
    
    comp - the Comparator that decides the sorting order
    
    Note:
    
    This parallelization is invoked through SanityChecks.invokeTask(java.util.concurrent.ForkJoinTask<T>) which the threadpool can be changed as needed
  - parallelMemFreeMergeSort
```
public static void parallelMemFreeMergeSort(int[] array,
                                            int length,
                                            IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator using Parallel Memory Free Merge Sort, This implementation is inspired by FastUtil original merge sort, but without the need to allocate a copy of the original Array. It is depending on the size and the unsorted level of the input array slower or almost as fast as normal merge sort. Depending on the test size i can be 0.5x slower (5000 elements) or 4x slower (50000 elements) under the assumtion that the array is in its worst case scenario. It does stack allocate tiny amounts of data for shifting around elements.
    
    Parameters:
    
    array - the array that needs to be sorted
    
    length - the maxmium size of the array to be sorted
    
    comp - the Comparator that decides the sorting order
    
    Note:
    
    This parallelization is invoked through SanityChecks.invokeTask(java.util.concurrent.ForkJoinTask<T>) which the threadpool can be changed as needed
  - parallelMemFreeMergeSort
```
public static void parallelMemFreeMergeSort(int[] array,
                                            int from,
                                            int to,
                                            IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator using Parallel Memory Free Merge Sort, This implementation is inspired by FastUtil original merge sort, but without the need to allocate a copy of the original Array. It is depending on the size and the unsorted level of the input array slower or almost as fast as normal merge sort. Depending on the test size i can be 0.5x slower (5000 elements) or 4x slower (50000 elements) under the assumtion that the array is in its worst case scenario. It does stack allocate tiny amounts of data for shifting around elements.
    
    Parameters:
    
    array - the array that needs to be sorted
    
    from - where the array should be sorted from
    
    to - where the array should be sorted to
    
    comp - the Comparator that decides the sorting order
    
    Note:
    
    This parallelization is invoked through SanityChecks.invokeTask(java.util.concurrent.ForkJoinTask<T>) which the threadpool can be changed as needed
  - parallelMemFreeMergeSort
```
public static void parallelMemFreeMergeSort(int[] array)
```
    Sorts an array according to the natural ascending order using Parallel Memory Free Merge Sort, This implementation is inspired by FastUtil original merge sort, but without the need to allocate a copy of the original Array. It is depending on the size and the unsorted level of the input array slower or almost as fast as normal merge sort. Depending on the test size i can be 0.5x slower (5000 elements) or 4x slower (50000 elements) under the assumtion that the array is in its worst case scenario. It does stack allocate tiny amounts of data for shifting around elements.
    
    Parameters:
    
    array - the array that needs to be sorted
    
    Note:
    
    This parallelization is invoked through SanityChecks.invokeTask(java.util.concurrent.ForkJoinTask<T>) which the threadpool can be changed as needed
  - parallelMemFreeMergeSort
```
public static void parallelMemFreeMergeSort(int[] array,
                                            int length)
```
    Sorts an array according to the natural ascending order using Parallel Memory Free Merge Sort, This implementation is inspired by FastUtil original merge sort, but without the need to allocate a copy of the original Array. It is depending on the size and the unsorted level of the input array slower or almost as fast as normal merge sort. Depending on the test size i can be 0.5x slower (5000 elements) or 4x slower (50000 elements) under the assumtion that the array is in its worst case scenario. It does stack allocate tiny amounts of data for shifting around elements.
    
    Parameters:
    
    array - the array that needs to be sorted
    
    length - the maxmium size of the array to be sorted
    
    Note:
    
    This parallelization is invoked through SanityChecks.invokeTask(java.util.concurrent.ForkJoinTask<T>) which the threadpool can be changed as needed
  - parallelMemFreeMergeSort
```
public static void parallelMemFreeMergeSort(int[] array,
                                            int from,
                                            int to)
```
    Sorts an array according to the natural ascending order using Parallel Memory Free Merge Sort, This implementation is inspired by FastUtil original merge sort, but without the need to allocate a copy of the original Array. It is depending on the size and the unsorted level of the input array slower or almost as fast as normal merge sort. Depending on the test size i can be 0.5x slower (5000 elements) or 4x slower (50000 elements) under the assumtion that the array is in its worst case scenario. It does stack allocate tiny amounts of data for shifting around elements.
    
    Parameters:
    
    array - the array that needs to be sorted
    
    from - where the array should be sorted from
    
    to - where the array should be sorted to
    
    Note:
    
    This parallelization is invoked through SanityChecks.invokeTask(java.util.concurrent.ForkJoinTask<T>) which the threadpool can be changed as needed
  - quickSort
```
public static void quickSort(int[] array,
                             IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator using Quick Sort, This implementation is a custom of FastUtil quicksort but with a different code structure, and that sorting Algorithm is based on the tuned quicksort adapted from Jon L. Bentley and M. DouglasMcIlroy, "Engineering a Sort Function", Software: Practice and Experience, 23(11), pages1249−1265, 1993.
    
    Parameters:
    
    array - the array that needs to be sorted
    
    comp - the Comparator that decides the sorting order
  - quickSort
```
public static void quickSort(int[] array,
                             int length,
                             IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator using Quick Sort, This implementation is a custom of FastUtil quicksort but with a different code structure, and that sorting Algorithm is based on the tuned quicksort adapted from Jon L. Bentley and M. DouglasMcIlroy, "Engineering a Sort Function", Software: Practice and Experience, 23(11), pages1249−1265, 1993.
    
    Parameters:
    
    array - the array that needs to be sorted
    
    length - the maxmium size of the array to be sorted
    
    comp - the Comparator that decides the sorting order
  - quickSort
```
public static void quickSort(int[] array,
                             int from,
                             int to,
                             IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator using Quick Sort, This implementation is a custom of FastUtil quicksort but with a different code structure, and that sorting Algorithm is based on the tuned quicksort adapted from Jon L. Bentley and M. DouglasMcIlroy, "Engineering a Sort Function", Software: Practice and Experience, 23(11), pages1249−1265, 1993.
    
    Parameters:
    
    array - the array that needs to be sorted
    
    from - where the array should be sorted from
    
    to - where the array should be sorted to
    
    comp - the Comparator that decides the sorting order
  - quickSort
```
public static void quickSort(int[] array)
```
    Sorts an array according to the natural ascending order using Quick Sort, This implementation is a custom of FastUtil quicksort but with a different code structure, and that sorting Algorithm is based on the tuned quicksort adapted from Jon L. Bentley and M. DouglasMcIlroy, "Engineering a Sort Function", Software: Practice and Experience, 23(11), pages1249−1265, 1993.
    
    Parameters:
    
    array - the array that needs to be sorted
  - quickSort
```
public static void quickSort(int[] array,
                             int length)
```
    Sorts an array according to the natural ascending order using Quick Sort, This implementation is a custom of FastUtil quicksort but with a different code structure, and that sorting Algorithm is based on the tuned quicksort adapted from Jon L. Bentley and M. DouglasMcIlroy, "Engineering a Sort Function", Software: Practice and Experience, 23(11), pages1249−1265, 1993.
    
    Parameters:
    
    array - the array that needs to be sorted
    
    length - the maxmium size of the array to be sorted
  - quickSort
```
public static void quickSort(int[] array,
                             int from,
                             int to)
```
    Sorts an array according to the natural ascending order using Quick Sort, This implementation is a custom of FastUtil quicksort but with a different code structure, and that sorting Algorithm is based on the tuned quicksort adapted from Jon L. Bentley and M. DouglasMcIlroy, "Engineering a Sort Function", Software: Practice and Experience, 23(11), pages1249−1265, 1993.
    
    Parameters:
    
    array - the array that needs to be sorted
    
    from - where the array should be sorted from
    
    to - where the array should be sorted to
  - parallelQuickSort
```
public static void parallelQuickSort(int[] array,
                                     IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator using Parallel Quick Sort, This implementation is a custom of FastUtil quicksort but with a different code structure, and that sorting Algorithm is based on the tuned quicksort adapted from Jon L. Bentley and M. DouglasMcIlroy, "Engineering a Sort Function", Software: Practice and Experience, 23(11), pages1249−1265, 1993.
    
    Parameters:
    
    array - the array that needs to be sorted
    
    comp - the Comparator that decides the sorting order
    
    Note:
    
    This parallelization is invoked through SanityChecks.invokeTask(java.util.concurrent.ForkJoinTask<T>) which the threadpool can be changed as needed
  - parallelQuickSort
```
public static void parallelQuickSort(int[] array,
                                     int length,
                                     IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator using Parallel Quick Sort, This implementation is a custom of FastUtil quicksort but with a different code structure, and that sorting Algorithm is based on the tuned quicksort adapted from Jon L. Bentley and M. DouglasMcIlroy, "Engineering a Sort Function", Software: Practice and Experience, 23(11), pages1249−1265, 1993.
    
    Parameters:
    
    array - the array that needs to be sorted
    
    length - the maxmium size of the array to be sorted
    
    comp - the Comparator that decides the sorting order
    
    Note:
    
    This parallelization is invoked through SanityChecks.invokeTask(java.util.concurrent.ForkJoinTask<T>) which the threadpool can be changed as needed
  - parallelQuickSort
```
public static void parallelQuickSort(int[] array,
                                     int from,
                                     int to,
                                     IntComparator comp)
```
    Sorts the specified range of elements according to the order induced by the specified comparator using Parallel Quick Sort, This implementation is a custom of FastUtil quicksort but with a different code structure, and that sorting Algorithm is based on the tuned quicksort adapted from Jon L. Bentley and M. DouglasMcIlroy, "Engineering a Sort Function", Software: Practice and Experience, 23(11), pages1249−1265, 1993.
    
    Parameters:
    
    array - the array that needs to be sorted
    
    from - where the array should be sorted from
    
    to - where the array should be sorted to
    
    comp - the Comparator that decides the sorting order
    
    Note:
    
    This parallelization is invoked through SanityChecks.invokeTask(java.util.concurrent.ForkJoinTask<T>) which the threadpool can be changed as needed
  - parallelQuickSort
```
public static void parallelQuickSort(int[] array)
```
    Sorts an array according to the natural ascending order using Parallel Quick Sort, This implementation is a custom of FastUtil quicksort but with a different code structure, and that sorting Algorithm is based on the tuned quicksort adapted from Jon L. Bentley and M. DouglasMcIlroy, "Engineering a Sort Function", Software: Practice and Experience, 23(11), pages1249−1265, 1993.
    
    Parameters:
    
    array - the array that needs to be sorted
    
    Note:
    
    This parallelization is invoked through SanityChecks.invokeTask(java.util.concurrent.ForkJoinTask<T>) which the threadpool can be changed as needed
  - parallelQuickSort
```
public static void parallelQuickSort(int[] array,
                                     int length)
```
    Sorts an array according to the natural ascending order using Parallel Quick Sort, This implementation is a custom of FastUtil quicksort but with a different code structure, and that sorting Algorithm is based on the tuned quicksort adapted from Jon L. Bentley and M. DouglasMcIlroy, "Engineering a Sort Function", Software: Practice and Experience, 23(11), pages1249−1265, 1993.
    
    Parameters:
    
    array - the array that needs to be sorted
    
    length - the maxmium size of the array to be sorted
    
    Note:
    
    This parallelization is invoked through SanityChecks.invokeTask(java.util.concurrent.ForkJoinTask<T>) which the threadpool can be changed as needed
  - parallelQuickSort
```
public static void parallelQuickSort(int[] array,
                                     int from,
                                     int to)
```
    Sorts an array according to the natural ascending order using Parallel Quick Sort, This implementation is a custom of FastUtil quicksort but with a different code structure, and that sorting Algorithm is based on the tuned quicksort adapted from Jon L. Bentley and M. DouglasMcIlroy, "Engineering a Sort Function", Software: Practice and Experience, 23(11), pages1249−1265, 1993.
    
    Parameters:
    
    array - the array that needs to be sorted
    
    from - where the array should be sorted from
    
    to - where the array should be sorted to
    
    Note:
    
    This parallelization is invoked through SanityChecks.invokeTask(java.util.concurrent.ForkJoinTask<T>) which the threadpool can be changed as needed

Class IntArrays

Field Summary

Constructor Summary

Method Summary

Methods inherited from class java.lang.Object

Field Detail

BASE_THRESHOLD

PARALLEL_THRESHOLD

EMPTY_ARRAY

Constructor Detail

IntArrays

Method Detail

wrap

wrap

wrap

unwrap

unwrap

unwrap

shiftDown

shiftUp

heapify

shuffle

shuffle

stableSort

stableSort

stableSort

stableSort

stableSort

stableSort

unstableSort

unstableSort

unstableSort

unstableSort

unstableSort

unstableSort

insertionSort

insertionSort

insertionSort

insertionSort

insertionSort

insertionSort

selectionSort

selectionSort

selectionSort

selectionSort

selectionSort

selectionSort

mergeSort

mergeSort

mergeSort

mergeSort

mergeSort

mergeSort

parallelMergeSort

parallelMergeSort

parallelMergeSort

parallelMergeSort

parallelMergeSort

parallelMergeSort

memFreeMergeSort

memFreeMergeSort

memFreeMergeSort

memFreeMergeSort

memFreeMergeSort

memFreeMergeSort

parallelMemFreeMergeSort

parallelMemFreeMergeSort

parallelMemFreeMergeSort

parallelMemFreeMergeSort

parallelMemFreeMergeSort

parallelMemFreeMergeSort

quickSort

quickSort

quickSort

quickSort

quickSort

quickSort

parallelQuickSort

parallelQuickSort

parallelQuickSort