Fast JavaScript array sorting by implementing Python's Timsort 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.

Conversion of JavaScript primitives to and from Buffer with binary order matching natural primitive order

Array manipulation, ordering, searching, summarizing, etc.

Micro library for sorting arrays using the firstBy().thenBy().thenBy() syntax

A tiny and fast selection algorithm in JavaScript.

Lightweight and performant natural sorting of arrays and collections by differentiating between unicode characters, numbers, dates, etc.

Isomorphic, load-anywhere function to sort an array by scalar, deep or computed values in any standard or custom order

Alphanumeric sorting algorithm

Essential JS 2 DataManager

JavaScript utilities for Vega.

A collection of order related linting rules for Stylelint.

Binary serialization which sorts bytewise for arbirarily complex data structures

Simple, expected, and deterministic best-match sorting of an array in JavaScript

Compare alphanumeric strings the same way a human would, using a natural order algorithm

Standalone Tailwind CSS class sorter with Prettier plugin compatibility, extracted from tailwindlabs/prettier-plugin-tailwindcss

Topological sorting with grouping support

File-based embedded data store for node.js

Compare strings containing a mix of letters and numbers in the way a human being would in sort order.

A Prettier plugin for sorting Tailwind CSS classes.