PermuteMergeSort

org.saddle.array.PermuteMergeSort$

In-place merge sort implementation. This sort is stable but does mutate the given array. It is an in-place sort but it does allocate a temporary array of the same size as the input. It uses InsertionSort for sorting very small arrays.

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Self type

Members list

Value members

Concrete methods

final def mergePerm[A](data: Array[A], in: Array[Int], out: Array[Int], start: Int, mid: Int, end: Int)(implicit o: Order[A]): Unit
final def sort[A : Order](data: Array[A], perm: Array[Int]): Unit
final def startStep: Int
final def startWidth: Int