ts-algorithms

Typescript algorithms and Data Structures


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

* Structures
* Linked list (generic doubly linked)
* Queue (FIFO)
* Stack (LIFO)
* Dictionary (hash table, hash map)
* Heap (binary min heap)
* PriorityQueue (based binary heap)
* Search
* Linear Search
* Binary Search
* Sorting
* Quicksort
* Hash functions
* fnv1a (32 bit)
* murmur2 (32 bit)
* murmur3 (32 bit)
* Sum32

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:

* 📝 The Big O Notation
* 📽️ Big O Notation