@aureooms/js-odd-even-mergesort/doc/manual/example.md

Batcher's odd-even mergesort algorithm for JavaScript

```js
let compare = require( "@aureooms/js-compare" ) ;

let a = [ 3 , 1 , 2 , 4 ] ;
oddevenmergesort.sort( compare.increasing , a , 0 , a.length ) ; // O(n log² n)
a ; // [ 1 , 2 , 3 , 4 ]
```