Search results
28 packages found
An npm package providing a collection of versatile sorting algorithms for various data types. This package includes efficient implementations of merge sort, heap sort, and quick sort, allowing developers to sort different types of data structures effortle
Classes that filter, sort and create pagination for your page. Easy to use and very fast!
A fast and performant *Least Frequently Used* (LFU) sorted set implementation for working with reasonably sized integers (unsigned). Trades memory for performance, optimised for frequently updating and counting a relatively small set of integers (integer
Quick sort for next.
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
Linear time selection algorithm for ndarrays
Quick Sort Algorithm Implementation
Async/Await style quicksort implemenation in Javascript
Optimized version of quicksort.
quick sort an array, fast in typescript
Quick and efficient random sampling of records utilizing a seed field.
Sort-algorithms regroup all the popular sorting algorithms.
A Lite(20KB) sorting package that gives the option to the array of objects to sort with several alogithms based on any key of that objects
- sort
- sorting
- object sorting
- bubble
- quick
- merge
- insertion
- selection
- collection sorting
- array of object sorting
A set of packages to help you to learn array sort by typescript
- bubbleSort
- bubbleSortSync
- bubbleSortAsync
- bucketSort
- bucketSortSync
- bucketSortAsync
- countingSort
- countingSortSync
- countingSortAsync
- heapSort
- heapSortSync
- heapSortAsync
- insertionSort
- insertionSortSync
- View more
Collection of ready-to-use implementation of some sorting algorithms such as: merge sort, quick sort, bubble sort, insertion sort