递归排序

var p = [
  5,
  2,
  3,
  1,
  7,
  5,
  6,
  9,
  6,
  0
];
p.sort(function down(a, b) {
  return (a < b) ? - 1 : 1;
});
console.log(p);

结果:[0, 1, 2, 3, 5, 5, 6, 6, 7, 9]

说明:-1不交换位置,1交换位置;

原文地址:https://www.cnblogs.com/lishidefengchen/p/6207599.html