数组排序

 

 

   冒泡排序

Array.prototype.swap = function (i, j) {
    var k = this[i]; this[i] = this[j]; this[j] = k;
}

 

function sort(list) {
   var items = list.slice(0), swapped = false, p, q;
   for (p = 1; p < items.length; ++p) {
      for (q = 0; q < items.length - p; ++q) {
           if (items[q + 1] < items[q]) {
               items.swap(q, q + 1);
               swapped =true;
           }
       }
       if (!swapped) break;
   }
      return items;
} 

 

 

用于调试

Array.prototype.swap = function (i, j) {
Log({ name: 'Array.prototype.swap', lineNumber: 1, range: [23, 94] });
    var k = this[i]; this[i] = this[j]; this[j] = k;
}