Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

comparison-sorting/merge-sort

Open more actions menu

Repository files navigation


IDEA Instructions developed by Sándor P. Fekete and Sebastian Morr.

Mergesort library for JavaScript. See docs. Parent is aureooms/js-sort.

import * as array from '@aureooms/js-array' ;
import * as merging from '@aureooms/js-merging' ;
import * as mergesort from '@aureooms/js-mergesort' ;

const sort = mergesort.recursive( merging.tapemerge , array.copy ) ;

let data = [ /*...*/ ] ;
let a = data.slice();
let b = new Array(data.length) ;

import { increasing } from '@aureooms/js-compare' ;
sort(increasing, a, 0, a.length, b, 0, b.length) ;

import { issorted } from '@aureooms/js-sort' ;
issorted(increasing, b, 0, b.length) ; // true

License Version Build Dependencies Dev dependencies GitHub issues Downloads

Code issues Code maintainability Code coverage (cov) Code technical debt Documentation Package size

🔗 Links

Packages

No packages published

Contributors 3

  •  
  •  
  •  
Morty Proxy This is a proxified and sanitized view of the page, visit original site.