冒泡排序法 ```js var array = [37, 63, 25, 74, 99, 18, 54, 260, 13, 1, 156]; for (var i = 0; i < array.length - 1; i++) { for (var j = 0; j < array.length - 1 - i; j++) { if (array[j] > array[j + 1]) { var tmp = array[j]; array[j] = array[j + 1]; array[j + 1] = tmp; } } } console.log(array) ``` sort排序法 ``` array.sort(function (a, b) { return a - b; }); console.log(array) ```