Fast sort | npm.io

Fast JavaScript array sorting by implementing Python's Timsort algorithm

fast sort array soft sort compare TimSort algorithm python performance

1.0.3 • Published 5 years ago

High Performance Computing Algorithms

sorting sort fast sort fast sorting faster sorting radix sort counting sort algorithm algorithms fast algorithm

1.1.0 • Published 6 years ago

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

sort sorting fast fast sorting fast sort quick quicksort quick sort small tiny

1.0.3 • Published 2 years ago

Fast sort Packages

array-timsort

hpc-algorithms

f-sort