High Performance Computing Algorithms

Usage no npm install needed!

<script type="module">
  import hpcAlgorithms from 'https://cdn.skypack.dev/hpc-algorithms';


If you like hpc-algorithms, then help us keep more good stuff like this coming.
Let us know what other algorithms could use acceleration or improvement.


High Performance Computing Algorithms in JavaScript

Faster and Better Algorithms, starting with high performance sorting:

  • LSD Radix Sort for unsigned 32-bit integer arrays. 20-30X faster than JavaScript's built-in array sort for arrays less than 35 Million. 5-10X faster for arrays greater than 35 Million. This sort algorithm is not in-place, returning a new sorted array. Discussion, benchmarks and usage in https://duvanenko.tech.blog/2017/06/15/faster-sorting-in-javascript/
  • LSD Radix Sort for arrays of objects by an unsigned integer key. 15X faster than JavaScript's built-in .sort(). This is a stable sort, while JavaScript built-in is not stable. This sort algorithm is not in-place, returning a new sorted array. Discussion, benchmarks and usage in https://duvanenko.tech.blog/2017/07/10/sorting-arrays-of-objects-in-javascript-with-radix-sort/
  • Counting Sort for Uint8 and Uint16 typed arrays. 40X faster for Uint8 arrays and 15X faster for Uint16 arrays. This sort algorithm is in-place.

When you benchmark these algorithms keep in mind that for the first few runs the basic JavaScript JIT compiler is used, providing fast start up time and giving time for the optimizing compiler to run. After these few runs the optimized code starts being used, revealing the full performance of LSD Radix Sort and Counting Sort algorithms. See https://blog.sessionstack.com/how-javascript-works-inside-the-v8-engine-5-tips-on-how-to-write-optimized-code-ac089e62b12e for more details about the JIT engine in Chrome.


function simpleUsageExampleOfRadixSortLSD() {
    var arrayToBeSorted = [ 99, 1999999999, 51, 23, 102];
    var sortedArray = HpcAlgorithms.Sorting.RadixSortLsdUInt32(arrayToBeSorted);
    for ( var _current = 0; _current < sortedArray.length; _current++ ) {

If you have other specific needs for higher performance algorithms, let us know.