Results for timsort

TimSort: Fast Sorting for Node.js

Fast JavaScript array sorting by implementing Python's Timsort algorithm

TypeScript definitions for timsort

TimSort sorting revived in TypeScript

Allows the use of Python's Timsort Algorithm in Javascript.

Functions for timsort with SQL-like json

A dynamic, browser-based visualization library.

The utils package for react testing library

sorting networks for up to 64 inputs. the fastest way to sort small lists.

Scoring-based fuzzy search with Myers Levenshtein distance and radix/tim sort ranking. Part of the ex-* ecosystem.

UMT Main Package is written in TypeScript and is a collection of useful functions for various tasks.

UMT Main Package is written in TypeScript and is a collection of useful functions for various tasks.

Faster sorting algorithm than Array.prototype.sort

Library for implementing various algorithms

Function takes an array of numbers and returns new array with numbers in numeric order

A powerful toolkit for data structures and algorithms in TypeScript, designed for optimal performance and versatility. The toolkit provides implementations of various data structures and algorithms, with a focus on search and sort operations, caching, and

A bountyful amount of algorithms to pick from, choose your poison.

A TypeScript library packed with handy functions designed to accelerate development across different platforms.

Javascripts fastest numeric sort

一个快速的 JavaScript 实用工具库

A hybrid sorting algorithm based on Quicksort and Average Sort

Simple prime number and prime factorization package

A lightweight, fully-typed TypeScript sorting library with 20 algorithms: bubble, insertion, selection, merge, quick, heap, tim, gnome, shell, intro, block, counting, radix, bucket, pigeonhole, cycle, bitonic, cocktail shaker, comb sort and circle sort. S

Algorithms and data structures in JavaScript