Algorithm Packages

Measure the difference between two strings using the Levenshtein distance algorithm

TimSort: Fast Sorting for Node.js

Tiny queue data structure

[](https://www.npmjs.com/package/levenary) [](https://github.com/tanhauhau/levenary/actions)

Fastest Levenshtein distance implementation in JS.

The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.

Hash a stream of data, then validate

A tiny and fast selection algorithm in JavaScript.

binary heap (priority queue) algorithms (ported from Python's heapq module)

The Fisher-Yates (aka Knuth) shuffle for Node.js, with seeding support

Fast 2D concave hull algorithm in JavaScript (generates an outline of a point set)

turf simplify module

Incremental n-dimensional convex hull algorithm

An algorithm for resolving imports in Sass

A fast polyline and polygon clipping library.

A JS library for finding optimal label position inside a polygon

Organize and layout items based on various algorithms

Test for deep equality - Node.js `assert.deepStrictEqual()` algorithm as a standalone module

Fast JavaScript array sorting by implementing Python's Timsort algorithm

Provides boundary functions, (upper-bound and lower-bound).