Algorithms: stable merge sort, quick sort, binary search, lower/upper bound (Node and Edge).

Fast easy to use and flexible sorting with TypeScript support

simple and fast quick-sort

A simple and efficient implementation of the Quick Sort algorithm in TypeScript. This package provides a flexible and fast sorting utility that can be used in both Node.js and browser environments.

A node module who does recursive quick sort over a deep array.

Sort an Object or package.json based on the well-known package.json keys

Easy autofixable import sorting

JSS plugin that ensures style properties extend each other instead of override

richer JavaScript errors

PostCSS plugin for sorting and combining CSS media queries with mobile first / **desktop first methodologies

Alphanumeric sorting algorithm

Memory Efficient Serialization Library

Rush plugin for sort package.json file in the project

Sort the keys of an object

An optimized implementation of binary search, quick sort ... algorithms in TypeScript

The custom `sort` method (mobile-first / desktop-first) of CSS media queries for `postcss-sort-media-queries`, `css-mqpacker` or `pleeease` (which uses css-mqpacker) or, perhaps, something else ))

Quick-sort arrays based on generic divide-and-conquer

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

vfile utility to sort messages by line/column

Sort array elements in ascending order.