f-sort

A fast, small (~0.5 KB gzipped) and dependency-free JavaScript library to sort arrays. It uses quick sort internally to sort arrays _in place_, without recursion. Simply replace JavaScript's built-in `Array.prototype.sort` with f-sort's `sort` to see ~2x

v1.0.3 URL: https://unpkg.com/f-sort@1.0.3/dist/index.umd.js

Open Browse Files

sort sorting fast fast sorting fast sort quick quicksort quick sort small tiny performance memory flexible

sort-algorithms

Sort-algorithms regroup all the popular sorting algorithms.

v1.1.0 URL: https://unpkg.com/sort-algorithms@1.1.0/index.js

Open Browse Files

package sorting sort bubble selection insertion radix bucket counting heap merge shell comb quick algorithm algorithms sort-algorithms

quick-lru

Simple “Least Recently Used” (LRU) cache

v7.3.0 URL: https://unpkg.com/quick-lru@7.3.0/index.js

Open Browse Files

lru quick cache caching least recently used fast map hash buffer

@alloc/quick-lru

Simple “Least Recently Used” (LRU) cache

v5.2.0 URL: https://unpkg.com/@alloc/quick-lru@5.2.0/index.js

Open Browse Files

lru quick cache caching least recently used fast map hash buffer