Algorithms

Partition around a pivot (Lomuto scheme, last element) and sort each side — O(n log n) on average.

Version 1.2.0 · current Versions: 1.2.0 1.1.0 1.0.0

Implementations

Sign in to open in IDE Sign in with your Zerethon account to create your own copy of this sample.

Files

README.md
# Quick Sort

Zerethon Official Sample `quick-sort`, version 1.2.0, Node.js 22.

- `quick_sort.js` — the algorithm, as shown in Zerethon Tools
- `main.js` — entry file: a short demonstration
- `test_quick_sort.js` — checks; set it as the entry file to run them

This project is your own copy. Changing it never changes the official sample.
See the algorithm animated: https://tools.zerethon.com/quick-sort-visualizer
main.js entry
const { quickSort } = require('./quick_sort');

const numbers = [38, 27, 43, 3, 9, 82, 10, 27];
console.log(`Before: [${numbers.join(', ')}]`);
const result = quickSort([...numbers]);
console.log(`After:  [${result.join(', ')}]`);
const expected = [...numbers].sort((x, y) => x - y);
console.log(`Same as sort(): ${result.join() === expected.join()}`);
quick_sort.js
// Quick Sort (Zerethon Official Sample: quick-sort 1.2.0).

function quickSort(a, lo = 0, hi = a.length - 1) {
    if (lo >= hi) return a;
    const pivot = a[hi];
    let i = lo;
    for (let j = lo; j < hi; j++) {
        if (a[j] < pivot) {
            [a[i], a[j]] = [a[j], a[i]];
            i++;
        }
    }
    [a[i], a[hi]] = [a[hi], a[i]];
    quickSort(a, lo, i - 1);
    quickSort(a, i + 1, hi);
    return a;
}

module.exports = { quickSort };
test_quick_sort.js
// Checks for quickSort. To run them, set this file as the entry file
// (the ▶ button next to it in Files) and press Run.
const assert = require('assert');
const { quickSort } = require('./quick_sort');

/** Deterministic pseudo-random integers in [-50, 49]. */
function numbers(seed, count) {
    const out = [];
    for (let i = 0; i < count; i++) {
        seed = (seed * 1103515245 + 12345) % 2 ** 31;
        out.push((seed % 100) - 50);
    }
    return out;
}

const cases = [[], [1], [2, 1], [1, 2, 3], [3, 2, 1], [5, 1, 5, 1, 5], [-3, 0, -1, 2]];
for (const [seed, size] of [[1, 10], [2, 50], [3, 200]]) cases.push(numbers(seed, size));

for (const c of cases) {
    const got = quickSort([...c]);
    assert.deepStrictEqual(got, [...c].sort((x, y) => x - y), `quickSort([${c.slice(0, 6)}...])`);
}

console.log(`All ${cases.length} checks passed.`);

Source: Zerethon Official Sample. Algorithm as shown in the Zerethon Tools Quick Sort Visualizer.