@aureooms/js-odd-even-mergesort
Version:
Batcher's odd-even mergesort algorithm for JavaScript
26 lines (21 loc) • 1.18 kB
JavaScript
;
Object.defineProperty(exports, "__esModule", {
value: true
});
exports.whole = whole;
var _range = require('./range');
var _marked = [whole].map(regeneratorRuntime.mark);
function whole(n) {
return regeneratorRuntime.wrap(function whole$(_context) {
while (1) {
switch (_context.prev = _context.next) {
case 0:
return _context.delegateYield((0, _range.range)(0, n), 't0', 1);
case 1:
case 'end':
return _context.stop();
}
}
}, _marked[0], this);
}
//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJzb3VyY2VzIjpbIi4uL3NyYy93aG9sZS5qcyJdLCJuYW1lcyI6WyJ3aG9sZSIsIm4iXSwibWFwcGluZ3MiOiI7Ozs7O1FBRWlCQSxLLEdBQUFBLEs7O0FBRmpCOztlQUVpQkEsSzs7QUFBVixTQUFVQSxLQUFWLENBQWtCQyxDQUFsQjtBQUFBO0FBQUE7QUFBQTtBQUFBO0FBQUEsa0RBRUksa0JBQU8sQ0FBUCxFQUFXQSxDQUFYLENBRko7O0FBQUE7QUFBQTtBQUFBO0FBQUE7QUFBQTtBQUFBO0FBQUEiLCJmaWxlIjoid2hvbGUuanMiLCJzb3VyY2VzQ29udGVudCI6WyJpbXBvcnQgeyByYW5nZSB9IGZyb20gJy4vcmFuZ2UnIDtcblxuZXhwb3J0IGZ1bmN0aW9uKiB3aG9sZSAoIG4gKSB7XG5cbiAgICB5aWVsZCogcmFuZ2UoIDAgLCBuICkgO1xuXG59XG5cbiJdfQ==