random-sort
v2.6.9
Published
Time inconsistent sorting algorithm based on array shuffling
Downloads
65
Readme
Random Sort
Time inconsistent sorting algorithm based on array shuffling!
Implementation of the Bogosort (also permutation sort, stupid sort, slowsort, shotgun sort or monkey sort) algorithm.
Average performance: O((n+1)!)
Installation
npm install --save random-sort
Usage
const sort = require('random-sort');
const array = [1, 7, 2, 4, 9, 3];
sort(array);
// [ 1, 2, 3, 4, 7, 9]
console.log(array);
API
sort<T>(array: T[], compare?: Function)
Sorts the array array
in place, optionally with the provided compare function compare
.