ts-ds / Complexity
Interface: Complexity
Defined in: sort/algorithms.ts:13
Asymptotic complexity written in big-O notation, e.g. "O(n log n)".
Properties
average
ts
average: string;Defined in: sort/algorithms.ts:17
Expected time on random input.
best
ts
best: string;Defined in: sort/algorithms.ts:15
Time on the most favourable input.
memory
ts
memory: string;Defined in: sort/algorithms.ts:21
Extra memory besides the input array.
worst
ts
worst: string;Defined in: sort/algorithms.ts:19
Time on the least favourable input.