Sorting code bricks for JavaScript.
Can be managed through duo, component, bower, or npm.
let sort = require( "aureooms-js-sort" ) ;
This package has several children:
- aureooms/js-bucketsort: bucketsort code bricks for JavaScript
- aureooms/js-countingsort: countingsort code bricks for JavaScript
- aureooms/js-heapsort: heapsort code bricks for JavaScript
- aureooms/js-in-situ-sort-spec: in place sorting code bricks for JavaScript
- aureooms/js-mergesort: mergesort code bricks for JavaScript
- aureooms/js-merging: merging code bricks for JavaScript
- aureooms/js-partition: partition code bricks for JavaScript
- aureooms/js-quicksort: quicksort code bricks for JavaScript
- aureooms/js-radixsort: radixsort code bricks for JavaScript
- aureooms/js-selection: selection code bricks for JavaScript
let array = require( "aureooms-js-array" ) ; let search = require( "aureooms-js-search" ) ; let compare = require( "aureooms-js-compare" ) ; let fordjohnson = function ( compare , a , i , j ) { sort._fordjohnson( search.binarysearch )( compare , array.swap , a , i , j ) ; } ; let a = [ 1 , 6 , 5 , 3 , 2 , 4 ] ; fordjohnson( compare.increasing , a , 0 , a.length ) ; a ; // [ 1 , 2 , 3 , 4 , 5 , 6 ] fordjohnson( compare.decreasing , a , 0 , a.length ) ; a ; // [ 6 , 5 , 4 , 3 , 2 , 1 ] // but also /** insertionsort */ let insertionsort = sort.insertionsort ; /** selectionsort */ let selectionsort = sort.selectionsort ; /** bubblesort */ let bubblesort = sort.bubblesort ;