A tiny and fast selection algorithm in JavaScript.

A O(n) sorting algorithm. Please don't use this in production.

A graph data structure with topological sort.

PostCSS plugin to keep rules and at-rules content in order.

Sorts CSS declarations fast and automatically in a certain order.

The fastest sorting algorithm ever, now available in JavaScript (and TypeScript).

Implements a blazingly fast O(???) sorting algorithm

perform array sorting using insertion sorting algorithm

Sorting the keys of an object

Stringify Object as tree structure

A simple, easy to use implementation of the Okapi BM25 algorithm.

Efficient Binary heap (priority queue, binary tree) data structure for JavaScript / TypeScript. Includes JavaScript methods, Python's heapq module methods, and Java's PriorityQueue methods.

The most stable sorting algorithm. Elements that disagree with the order simply... disappear.

Binary serialization which sorts bytewise for arbirarily complex data structures

A collection of order related linting rules for Stylelint.

Efficient implementation of Levenshtein algorithm with locale-specific collator support.

Sniff the encoding from a HTML byte stream

HFS Plus string utilities

Detect the indentation of code

The fastest and smallest JavaScript polygon triangulation library for your WebGL apps