Skip to content

make-github-pseudonymous-again/js-sorting

Repository files navigation

Sorting code bricks for JavaScript.

NPM license NPM version Bower version Build Status Coverage Status Dependencies Status devDependencies Status Code Climate NPM downloads per month GitHub issues Inline docs

Can be managed through duo, component, bower, or npm.

let sort = require( "aureooms-js-sort" ) ;

Subpackages

This package has several children:

Use

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 ;

Reference