ts-dsAlgorithms you can read, run and trust

Classic data structures and algorithms in TypeScript — implemented as the textbooks describe them, explained step by step, tested against millions of random inputs.

Getting started

Sorting algorithms

Learn

Every algorithm has a page with the idea, pseudocode, a worked example, complexity and when to use it. Written for students, with references to CLRS, Sedgewick and Knuth.

Use

Zero dependencies, ES modules and CommonJS, full TypeScript types, tree-shakable — quickSort alone is about 0.6 kB.

Trust

Every function is checked against Array.prototype.sort with property-based tests, including stability and O(n log n) comparison counts. 100% test coverage.