Nodejs Utililty Methods Array Insertion Sort

Array.prototype.insertSort = function () {
    'use strict';
    var lastIndex = this.length,
        temp,
        i,
        j;
    for ( i = 1 ; i < lastIndex ; i++ ) {
        for( j = 0 ; j < i ; j++ ){
            if( this[i] < this[j] ){
...

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

Array.prototype.insertSort=function(){
       var left=[];
      var res=this.splice(0,1)[0];
    left.push(res);
    for(var i=0;i<this.length;i++){
          var cur=this[i];
        for(var j=left.length-1;j>=0;){
             if(left[j]>cur){
                 j--;
...

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

Array.prototype.insertationSort = function() {
    this.procedures=[]
    var compare = 0
    var exchange = 0
    var comparet = this.length * this.length / 4
    var exchanget = comparet
    for (var i = 1; i < this.length; i++) {
        for (var j = i; j > 0; j--) {
            compare++
...

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]){
...

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;
...

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;

'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;

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;