Nodejs Array Insertion Sort insertionSort()

Method Source Code

"use strict";/*from  w w  w.j a  v  a2s  . c  om*/

/** 
 * Insertion sort
 */
Array.prototype.insertionSort = function() {
  // iterate from key 1 (not 0) to length - 1
  // compare with previous value, and swap until no swap
  // increment key
  for (var key = 1; key < this.length; key++) {
    // A bit strange to see this type of logic in a for-loop, but it
    // makes sense
    for (var swap_key = key; this[swap_key] < this[swap_key - 1]; swap_key--) {
      var temp = this[swap_key];
      this[swap_key] = this[swap_key - 1];
      this[swap_key - 1] = temp;
    }
  }
};

/**
 * Helper function 
 */
var assert = function(expression, name) {
  if ( ! expression) {
    console.log('** Assertion failed', name || '')
  }
}


/**
 * Tests
 */


var a1 = [5,4,3,6,7,1,2,8,9];
a1.insertionSort();
console.log(a1);
// Use toString() to compare arrays 
assert(a1.toString() === [1,2,3,4,5,6,7,8,9].toString(), 'Test it is sorted');

Related

1. insertion(arr)

   Array.prototype.insertion = function(arr){
       var returnArr = [];
       for(var i = 0; i < arr.length; i++){
           if(i==0){
               returnArr.push(arr[i]);
           }else{
               if(arr[i]<returnArr[i-1]){
                   var j = i;
                   while(j!=0&&arr[i]<returnArr[j]){
   ...
   

2. insertionSort()

   Array.prototype.insertionSort = function () {
     var i, j;
     var temp;
     for (i = 1; i < this.length; i++) {
       temp = this[i];
       for (j = i - 1; j >=0 && this[j] > temp; j--) {
         this[j + 1] = this[j];
       this[j + 1] = temp;
   ...
   

3. insertionSort()

   Array.prototype.insertionSort = function() {
     for(var i = 1; i < this.length; i++) {
       var hole = i;
       while (hole > 0 && this[hole - 1] > this[i]) {
         hole--;
       this.splice(hole, 0, this[i]);
       this.splice(i + 1, 1);
     return this;
   

4. insertionSort()

   'use strict';
   const ArraySorting = {};
   ArraySorting.insertionSort = a => {
       for(let o = 1; o < a.length; o++) {
           for(let i = o; i > 0 && a[i] < a[i-1]; i--) {
               [a[i], a[i-1]] = [a[i-1], a[i]]
   Array.prototype.insertionSort = function () {
       ArraySorting.insertionSort(this);
   exports.ArraySorting = ArraySorting;
   

5. insertionSort()

   Array.prototype.insertionSort = function(){
       if(this.length === 0)
           return "Array is empty!!";
       else if(this.length ===1)
           return this;
       else{
           for(var outerLoopIndex =1,arrLen = this.length;
               outerLoopIndex<arrLen;outerLoopIndex++)
               var temp = this[outerLoopIndex];
               for(var innerLoopIndex = outerLoopIndex-1;
                   innerLoopIndex >= 0 && this[innerLoopIndex] >                          temp ;innerLoopIndex--)
                   this[innerLoopIndex+1] = this[innerLoopIndex];   
               this[innerLoopIndex+1] = temp;
       return this;
   

6. insertionSort()

   Array.prototype.insertionSort = function () {
       for (var i = 1; i < this.length; i++) {
           var j = i, value = this[i];
           while(j > 0 && value < this[j-1]){
               this[j] = this[j-1];
               j--;
           this[j] = value;
   };
   

7. insertionSort(desc)

   Array.prototype.insertionSort = function(desc) {
     let A = Object.assign([], this)
     for(let j = 1; j < A.length; j++) {
       let key = A[j]
       let i = j - 1
       while(i >= 0 && (desc ? A[i] < key : A[i] > key)) {
         A[i + 1] = A[i]
         i = i - 1
       A[i + 1] = key
     return A
   let arr = [3, 8, 1, 6, 5, 4, 9, 2, 7]
   let ascending = arr.insertionSort() 
   let descending = arr.insertionSort(true) 
   Array.prototype.selectionSort = function(desc) {
     let A = Object.assign([], this)
     for(let j = 0; j < A.length; j++) {
       let key = A[j]
       let m = j
       for(let i = j; i < A.length; i++) {
         m = (desc ? A[i] > A[m] : A[i] < A[m]) ? i : m
       A[j] = A[m]
       A[m] = key
     return A
   let arr = [3, 8, 1, 6, 5, 4, 9, 2, 7]
   let ascending = arr.selectionSort() 
   let descending = arr.selectionSort(true) 
   

8. insertionSort (array)

   Array.prototype.sort = function(){
     console.log("Please don't use the built in sort function.")
   function insertionSort (array) {
     let current, i, j;
     for (i in array) {
       current = array[i];
       for (j=i-1; j>-1 && (array[j] > current); j--) {
         array[j+1] = array[j];
   ...
   

9. insertion_sort(array)

   'use strict';
   Array.prototype.swap = function swap (a, b) {
     const temp = this[a];
     this[a] = this[b];
     this[b] = temp;
   };
   function insertion_sort (arr) {
     for (let i = 0; i < arr.length; i++) {
       let j = i;
   ...