arr=[5,100,6,3,-12];

newarr=arr.sort(comp);

function comp(a,b){

return a-b

}

console.log(newarr);

var ar=[5,5100,6,3,-12];

var arr=arr.sort();

document.write(arr);

q

let num = 0;

/***

       * list 排序数组

       * flag 升序or降序

       ***/

var createSort = function(list, flag = true) {

let length = list.length;

if (list.length <= 1) return list;

num++;

let index = 1;

let memo = list[0];

let leftArr = [];

let rightArr = [];

for(;index < length; index++) {

if (flag) {

if (list[index] < memo) {

leftArr.push(list[index])

} else {

rightArr.push(list[index])

}

} else {

if (list[index] > memo) {

leftArr.push(list[index])

} else {

rightArr.push(list[index])

}

}

}

return createSort(leftArr).concat([memo], createSort(rightArr))

}

console.log(createSort([5, 100, 6, 3, -12], true));

console.log(num);