ts-ds / ComparisonSortingAlgorithm

Interface: ComparisonSortingAlgorithm

Defined in: sort/algorithms.ts:37

A sorting algorithm that orders any values with a comparator.

Extends

• AlgorithmInfo

Properties

complexity

complexity: Complexity;

Defined in: sort/algorithms.ts:33

Inherited from

AlgorithmInfo.complexity

---

id

id: string;

Defined in: sort/algorithms.ts:26

Short identifier, the same as the key in the sort object.

Inherited from

AlgorithmInfo.id

---

inPlace

inPlace: boolean;

Defined in: sort/algorithms.ts:32

Needs only O(1) or O(log n) extra memory.

Inherited from

AlgorithmInfo.inPlace

---

kind

kind: "comparison";

Defined in: sort/algorithms.ts:38

---

name

name: string;

Defined in: sort/algorithms.ts:28

English name, e.g. "Quick sort".

Inherited from

AlgorithmInfo.name

---

sort

sort: <T>(array, compareFn?) => void;

Defined in: sort/algorithms.ts:39

Type Parameters

Type Parameter
T

Parameters

Parameter	Type
array	T[]
compareFn?	CompareFn<T>

Returns

void

---

stable

stable: boolean;

Defined in: sort/algorithms.ts:30

Equal elements keep their original order.

Inherited from

AlgorithmInfo.stable