// 模拟sort的内部实现
arr.sort(function (a, b) {
return a - b;
});
console.log(arr);
arr.mySort()
Array.prototype.mySort = function (fn) {
for (var i = 0; i < this.length - 1; i++) {
var isSort = true; // 假设排好序
for (var j = 0; j < this.length - i - 1; j++) {
if (fn(this[j], this[j + 1]) > 0) {
isSort = false;
var tmp = this[j];
this[j] = this[j + 1];
this[j + 1] = tmp;
}
}
if (isSort) {
break;
}
}
}
var arr = [35, 1, 6, 20];
arr.mySort(function (a, b) {
return b - a;
})
console.log(arr);
Processed:
0.010, SQL:
8
