【js-排序算法】冒泡排序

交换原理： var arr = [0, 99]; for (var i = 0, len = arr.length-1; i < len; i++) { var temp = arr[i]; // 存储 // 交换 arr[i] = arr[i+1]; arr[i+1] = temp; } arr; // [99, 0] 实现： var arr = [22,4,154,1,515,61,24,5,0]; for (var i = 0, len = arr.length-1; i < len; i++) { for (var j = 0; j < len - i; j++) { if (arr[j] > arr[j+1]) { var temp = arr[j]; arr[j] = arr[j+1]; arr[j+1] = temp; } } } arr; // [0, 1, 4, 5, 22, 24, 61, 154, 515] 封装： Array.prototype.bubbleSort = function() { var temp = 0, len = this.length-1; for (var i = 0; i < len; i++) { for (var j = 0; j < len - i; j++) { if (arr[j] > arr[j+1]) { temp = arr[j]; arr[j] = arr[j+1]; arr[j+1] = temp; } } } return this; }