Array.prototype.bubble_sort = function() {var i, j, tempfor (i = 0; i < this.length - 1; i++)for (j = 0; j < this.length - 1 - i; j++)if (this[j] > this[j + 1]) {temp = this[j]this[j] = this[j + 1]this[j + 1] = temp}return this
}

Array.prototype.bubble_sort_improve = function() {var i = this.length - 1 //初始时,最后位置保持不变while (i > 0) {var pos = 0 //每趟开始时,无记录交换for (var j = 0; j < i; j++)if (this[j] > this[j + 1]) {pos = j //记录交换的位置var tmp = this[j]this[j] = this[j + 1]this[j + 1] = tmp}i = pos //为下一趟排序作准备}return this
}

Array.prototype.selection_sort = function() {var i, j, minvar tempfor (i = 0; i < this.length - 1; i++) {min = ifor (j = i + 1; j < this.length; j++) if (this[min] > this[j]) min = jtemp = this[min]this[min] = this[i]this[i] = temp}
}

Array.prototype.insertion_sort = function() {var i, jfor (i = 1; i < this.length; i++) {for (j = 0; j < i; j++) {if (this[j] > this[i]) {this.splice(j, 0, this[i])this.splice(i + 1, 1)}}}return this
}

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

Array.prototype.merge_sort = function() {var merge = function(left, right) {var final = []while (left.length && right.length)final.push(left[0] <= right[0] ? left.shift() : right.shift())return final.concat(left.concat(right))}var len = this.lengthif (len < 2) return thisvar mid = len / 2return merge(this.slice(0, parseInt(mid)).merge_sort(),this.slice(parseInt(mid)).merge_sort())
}

Array.prototype.quick_sort = function() {var len = this.lengthif (len <= 1) return this.slice(0)var left = []var right = []var mid = [this[0]]for (var i = 1; i < len; i++)if (this[i] < mid[0]) left.push(this[i])else right.push(this[i])return left.quick_sort().concat(mid.concat(right.quick_sort()))
}

Array.prototype.heap_sort = function() {var arr = this.slice(0)function swap(i, j) {var tmp = arr[i]arr[i] = arr[j]arr[j] = tmp}function max_heapify(start, end) {//建立父节点指标和子节点指标var dad = startvar son = dad * 2 + 1if (son >= end)//若子节点指标超过范围直接跳出函數returnif (son + 1 < end && arr[son] < arr[son + 1])//先比较两个子节点大小，选择最大的son++if (arr[dad] <= arr[son]) {//如果父节点小于子节点时，交换父子内容再继续子节点和孙节点比较swap(dad, son)max_heapify(son, end)}}var len = arr.length//初始化，i从最后一个父节点开始调整for (var i = Math.floor(len / 2) - 1; i >= 0; i--) max_heapify(i, len)//先将第一个元素和已排好元素前一位做交换，再重新调整，直到排序完毕for (var i = len - 1; i > 0; i--) {swap(0, i)max_heapify(0, i)}return arr
}

Array.prototype.counting_sort = function() {var len = this.length,B = [],C = [],min = (max = this[0])for (var i = 0; i < len; i++) {min = min <= this[i] ? min : this[i]max = max >= this[i] ? max : this[i]C[this[i]] = C[this[i]] ? C[this[i]] + 1 : 1}for (var j = min; j < max; j++) {C[j + 1] = (C[j + 1] || 0) + (C[j] || 0)}for (var k = len - 1; k >= 0; k--) {B[C[this[k]] - 1] = this[k]C[this[k]]--}return B
}

Array.prototype.bucket_sort = function(num) {if (this.length <= 1) {return this}var len = this.length,buckets = [],result = [],min = (max = this[0]),regex = '/^[1-9]+[0-9]*$/',space,n = 0num = num || (num > 1 && regex.test(num) ? num : 10)for (var i = 1; i < len; i++) {min = min <= this[i] ? min : this[i]max = max >= this[i] ? max : this[i]}space = (max - min + 1) / numfor (var j = 0; j < len; j++) {var index = Math.floor((this[j] - min) / space)if (buckets[index]) {//  非空桶，插入排序var k = buckets[index].length - 1while (k >= 0 && buckets[index][k] > this[j]) {buckets[index][k + 1] = buckets[index][k]k--}buckets[index][k + 1] = this[j]} else {//空桶，初始化buckets[index] = []buckets[index].push(this[j])}}while (n < num) {result = result.concat(buckets[n])n++}return result
}

Array.prototype.radix_sort = function(maxDigit) {var mod = 10var dev = 1var counter = []console.time('基数排序耗时')for (var i = 0; i < maxDigit; i++, dev *= 10, mod *= 10) {for (var j = 0; j < this.length; j++) {var bucket = parseInt((this[j] % mod) / dev)if (counter[bucket] == null) {counter[bucket] = []}counter[bucket].push(this[j])}var pos = 0for (var j = 0; j < counter.length; j++) {var value = nullif (counter[j] != null) {while ((value = counter[j].shift()) != null) {this[pos++] = value}}}}console.timeEnd('基数排序耗时')return this
}