Here you can find the source of insertSort()
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];//from w w w . j a v a 2s . c om inp--; } this[inp] = temp; } return this; } var a = [23,34,24,56,67,98,14,28,39]; console.log(a.length); a.insertSort(); console.log(a);
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(){ 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]){ ...