https://github.com/iainjreid/jumpsort

📑 Efficiently calculate the smallest number of steps required to sort an array via insertion
https://github.com/iainjreid/jumpsort

array array-manipulations insertion-sort javascript nodejs shell-sort sorting sorting-algorithms

Last synced: about 1 month ago
JSON representation

📑 Efficiently calculate the smallest number of steps required to sort an array via insertion

• Host: GitHub
• URL: https://github.com/iainjreid/jumpsort
• Owner: iainjreid
• Created: 2017-05-11T15:04:35.000Z (about 9 years ago)
• Default Branch: master
• Last Pushed: 2017-05-12T08:24:10.000Z (about 9 years ago)
• Last Synced: 2025-08-09T09:25:45.531Z (10 months ago)
• Topics: array, array-manipulations, insertion-sort, javascript, nodejs, shell-sort, sorting, sorting-algorithms
• Language: JavaScript
• Homepage:
• Size: 4.88 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# Jumpsort

Calculate and replay the insertions between two states of an Array

[![npm](https://img.shields.io/npm/v/jumpsort.svg?style=flat-square)](https://www.npmjs.com/package/jumpsort)