0.0.13 • Published 5 years ago

@pencroff/ts-algorithms v0.0.13

Weekly downloads
-
License
MIT
Repository
github
Last release
5 years ago

ts-algorithms

Typescript algorithms and Data Structures

Build Status codecov

Get started

npm i @pencroff/ts-algorithms --save

The package doesn't provide any common exports. All required imports should be per item. For example:

import { genericComparator } from '@pencroff/ts-algorithms/dist/primitive/comparator'

const res = genericComparator('A', 'B'); // returns -1, check primitives for details

Algorithms

Theory

Big O notation is used in computer science to describe the performance or complexity of an algorithm.

Big O chart source: www.bigocheatsheet.com

Big O can be used for measuring time complexity or space / memory complexity.

References:

0.0.13

5 years ago

0.0.11

6 years ago

0.0.12

6 years ago

0.0.10

6 years ago

0.0.9

6 years ago

0.0.8

6 years ago

0.0.7

6 years ago

0.0.6

6 years ago

0.0.5

6 years ago

0.0.4

6 years ago

0.0.3

6 years ago

0.0.2

6 years ago

0.0.1

6 years ago