@bemoje/arr-quick-sort-numeric
v1.0.1
Published
Efficient in-place recursive sorting algorithm of numeric values. Avg. Runtime: O(n log n) | Worst: O(n^2)
Downloads
6
Maintainers
Readme
@bemoje/arr-quick-sort-numeric
Efficient in-place recursive sorting algorithm of numeric values. Avg. Runtime: O(n log n) | Worst: O(n^2)
Version
Travis CI
Dependencies
Stats
Donate
Installation
npm install @bemoje/arr-quick-sort-numeric
npm install --save @bemoje/arr-quick-sort-numeric
npm install --save-dev @bemoje/arr-quick-sort-numeric
Usage
import arrQuickSortNumeric from '@bemoje/arr-quick-sort-numeric'
arrQuickSortNumeric([5, 2, 3, 1, 4])
//=> [1, 2, 3, 4, 5]
Tests
Uses Jest to test module functionality. Run tests to get coverage details.
npm run test
API
arrQuickSortNumeric
Efficient in-place recursive sorting algorithm of numeric values. Avg. Runtime: O(n log n) | Worst: O(n^2)