Here you can find the source of selectSort()
Array.prototype.selectSort = function() { for(var i = 0; i <= this.length - 2; i++) { var index = i; for(var z = i + 1; z <= this.length - 1; z++) { if(this[z] < this[index]) { index = z;//from w ww .java 2 s. c o m } } if(index != i) { var temp = this[i]; this[i] = this[index]; this[index] = temp; } } return this; } var a = [23,34,24,56,67,98,14,28,39]; console.log(a.length); a.selectSort(); console.log(a);
Array.prototype.selectSort = function(){ var temp,min_index,len = this.length; for(var i = 0;i < len;i++){ min_index = i; for(var j = i + 1;j < len;j++){ if(this[j] < this[min_index]){ min_index = j; if(min_index != i){ temp = this[i]; this[i] = this[min_index]; this[min_index] = temp; return this;
Array.prototype.selectionSort = function () { var i, j, min; var temp; for (i = 0; i < this.length - 1; i++) { min = i; for (j = i + 1; j < this.length; j++) { if (this[min] > this[j]) { min = j; temp = this[min]; this[min] = this[i]; this[i] = temp; };
Array.prototype.selectionSort = function () { 'use strict'; var lastIndex = this.length, temp, i, j, smaller; for( i = 0 ; i < lastIndex ; i++){ smaller = i; ...
Array.prototype.selectionSort=function(){ var sorted=[]; while(this.length){ var minIndex=0; for(var i=0; i<=this.length;i++) { if (this[i] < this[minIndex]) { minIndex = i; sorted.push(this[minIndex]); this.splice(minIndex,1); this.push(sorted); }; var numbers=[4, 1, 1, 4, 2, 3, 4, 4, 1, 2, 4, 9, 3 ]; numbers.selectionSort(); console.log('numbers=[4, 1, 1, 4, 2, 3, 4, 4, 1, 2, 4, 9, 3 ];'); console.log(numbers.join(', '));