Skip to content

Instantly share code, notes, and snippets.

@mitrakmt

mitrakmt/insertionSort.js

Last active November 26, 2019 23:28
Show Gist options
  • Save mitrakmt/9e1b3440db54daa78bd9a4db0ceea3c1 to your computer and use it in GitHub Desktop.
Save mitrakmt/9e1b3440db54daa78bd9a4db0ceea3c1 to your computer and use it in GitHub Desktop.
Download ZIP

Revisions

  1. mitrakmt revised this gist Nov 26, 2019. 1 changed file with 12 additions and 11 deletions.
    23 changes: 12 additions & 11 deletions insertionSort.js
    View file
    Original file line number Diff line number Diff line change
    @@ -1,13 +1,14 @@
    function insertionSort(array) {
    var length = array.length;
    const insertionSort = (array) => {
    const length = array.length;

    for(var i = 1, j; i < length; i++) {
    var temp = array[i];
    for(var j = i - 1; j >= 0 && array[j] > temp; j--) {
    array[j+1] = array[j];
    for (let i = 1; i < length; i++) {
    let key = array[i];
    let j = i - 1;
    while (j >= 0 && array[j] > key) {
    array[j + 1] = array[j];
    j = j - 1;
    }
    array[j+1] = key;
    }
    array[j+1] = temp;
    }

    return array;
    }
    return array;
    };
  2. mitrakmt revised this gist Jul 18, 2018. 1 changed file with 1 addition and 1 deletion.
    2 changes: 1 addition & 1 deletion insertionSort.js
    View file
    Original file line number Diff line number Diff line change
    @@ -1,7 +1,7 @@
    function insertionSort(array) {
    var length = array.length;

    for(var i = 1; i < length; i++) {
    for(var i = 1, j; i < length; i++) {
    var temp = array[i];
    for(var j = i - 1; j >= 0 && array[j] > temp; j--) {
    array[j+1] = array[j];
  3. mitrakmt revised this gist Oct 1, 2016. 1 changed file with 5 additions and 4 deletions.
    9 changes: 5 additions & 4 deletions insertionSort.js
    View file
    Original file line number Diff line number Diff line change
    @@ -1,12 +1,13 @@
    function insertionSort(array) {
    var length = array.length;
    for(var i = 1; i < length; ++i) {

    for(var i = 1; i < length; i++) {
    var temp = array[i];
    var j = i - 1;
    for(; j >= 0 && array[j] > temp; --j) {
    for(var j = i - 1; j >= 0 && array[j] > temp; j--) {
    array[j+1] = array[j];
    }
    array[j+1] = temp;
    }

    return array;
    };
    }
  4. mitrakmt revised this gist Sep 29, 2016. 1 changed file with 9 additions and 12 deletions.
    21 changes: 9 additions & 12 deletions insertionSort.js
    View file
    Original file line number Diff line number Diff line change
    @@ -1,15 +1,12 @@
    function sort(array, compare) {
    for (var i = 1; i < array.length; i++) {
    var item = array[i];
    var indexHole = i;
    while (indexHole > 0 && compare(array[indexHole - 1], item) > 0) {
    array[indexHole] = array[--indexHole];
    }
    array[indexHole] = item;
    if (sortExternal.shiftObserver) {
    sortExternal.shiftObserver(i, indexHole);
    function insertionSort(array) {
    var length = array.length;
    for(var i = 1; i < length; ++i) {
    var temp = array[i];
    var j = i - 1;
    for(; j >= 0 && array[j] > temp; --j) {
    array[j+1] = array[j];
    }
    array[j+1] = temp;
    }

    return array;
    }
    };
  5. mitrakmt created this gist Sep 29, 2016.
    15 changes: 15 additions & 0 deletions insertionSort.js
    View file
    Original file line number Diff line number Diff line change
    @@ -0,0 +1,15 @@
    function sort(array, compare) {
    for (var i = 1; i < array.length; i++) {
    var item = array[i];
    var indexHole = i;
    while (indexHole > 0 && compare(array[indexHole - 1], item) > 0) {
    array[indexHole] = array[--indexHole];
    }
    array[indexHole] = item;
    if (sortExternal.shiftObserver) {
    sortExternal.shiftObserver(i, indexHole);
    }
    }

    return array;
    }