InsertionSort

org.saddle.array.InsertionSort$
object InsertionSort

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

Value members

Concrete methods

final def sort[A : Order](data: Array[A]): Unit

Sorts data in place using insertion sort.

Sorts data in place using insertion sort.

Type parameters

A

a member of the type class Order

Value parameters

data

the array to be sorted

Attributes

final def sort[A](data: Array[A], start: Int, end: 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. 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 parameters

A

a member of the type class Order

Value parameters

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

Attributes