PermuteInsertionSort

org.saddle.array.PermuteInsertionSort$

An implementation of insertion sort.

Works well for small arrays but due to quadratic complexity is not generally optimal.

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Self type

Members list

Concise view

Value members

Concrete methods

final def sort[A](data: Array[A], start: Int, end: Int, perm: Array[Int])(implicit o: Order[A]): Unit

Uses insertion sort on data to sort the entries from the index start up to, but not including, the index end. Permutation indices are returned in perm: data[perm[k]] is the k-th smallest elem in data data is not modified. Does not allocate, except on stack.

Uses insertion sort on data to sort the entries from the index start up to, but not including, the index end. Permutation indices are returned in perm: data[perm[k]] is the k-th smallest elem in data data is not modified. Does not allocate, except on stack.

Attributes

A

a member of the type class Order

data

the array to be sorted

end

the index of the last element, exclusive, to be sorted

perm

array of permutation indices

start

the index of the first element, inclusive, to be sorted