📶 @aureooms/js-sort
© xkcd.com
Sorting algorithms for JavaScript. See docs. Parent is @aureooms/js-algorithms.
🏗️ Caveat emptor! This is work in progress. Code may be working. Documentation may be present. Coherence may be. Maybe.
import {isSorted} from '@comparison-sorting/is-sorted';
import {increasing, decreasing} from '@total-order/primitive';
isSorted(increasing, [1, 2, 3], 0, 3); // true
isSorted(decreasing, [1, 2, 3], 0, 3); // false
👶 Children
This package has several children:
⚖️ Comparison sorting
-
📔 aureooms/js-in-situ-sort-spec: in place sorting for JavaScript-
🍃 aureooms/js-heapsort: heapsort for JavaScript -
🐇 aureooms/js-quicksort: quicksort for JavaScript -
⏪ aureooms/js-insertion-sort: Insertion sorting algorithms for JavaScript -
🤺 aureooms/js-merge-insertion-sort: Ford-Johnson algorithm for JavaScript
-
-
🐉 aureooms/js-mergesort: mergesort for JavaScript -
🎼 aureooms/js-odd-even-mergesort: Batcher's odd-even mergesort for JavaScript
Subroutines
-
🌖 aureooms/js-merging: merging for JavaScript -
🍰 aureooms/js-partition: partition for JavaScript -
👇 aureooms/js-selection: selection for JavaScript
💤 Integer sorting
-
🍢 aureooms/js-radix-sort: Radix sorting algorithms for JavaScript - aureooms/js-countingsort: countingsort for JavaScript
- aureooms/js-bucketsort: bucketsort for JavaScript