core/spire.math/InsertionSort

InsertionSort

object InsertionSort extends Sort

An implementation of insertion sort.

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

trait Sort
class Object
trait Matchable
class Any

Value members

Concrete methods

final
def sort[@specialized A : ClassTag](data: Array[A]): Unit

Sorts data in place using insertion sort.

Sorts data in place using insertion sort.

Type Params
A

a member of the type class Order

Value Params
data

the array to be sorted

final
def sort[@specialized A : Order](data: Array[A], start: Int, end: Int): Unit

Uses insertion sort on data to sort the entries from the index start up to, but not including, the index end. Operates in place.

Uses insertion sort on data to sort the entries from the index start up to, but not including, the index end. Operates in place.

Type Params
A

a member of the type class Order

Value Params
data

the array to be sorted

end

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

start

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