低效排序法

冒泡排序法
function swap(items, firstIndex, secondIndex){ var temp = items[firstIndex]; items[firstIndex] = items[secondIndex]; items[secondIndex] = temp; }; function bubbleSort(items){ var len = items.length, i, j, stop; for (i = 0; i < len; i++){ for (j = 0, stop = len-i; j < stop; j++){ if (items[j] > items[j+1]){ swap(items, j, j+1); } } } return items; }
选择排序法
function swap(items, firstIndex, secondIndex){ var temp = items[firstIndex]; items[firstIndex] = items[secondIndex]; items[secondIndex] = temp; }; function selectionSort(){ let items = [...document.querySelectorAll('.num-queue span')].map(num => +num.textContent); let len = items.length, min; for (i = 0; i < len; i++){ min = i; for(j = i + 1; j < len; j++){ if(items[j] < items[min]){ min = j; } } if(i != min){ swap(items, i, min); } } return items; };
插入排序法
function insertionSort(items) { let len = items.length, value, i, j; for (i = 0; i < len; i++) { value = items[i]; for (j = i-1; j > -1 && items[j] > value; j--) { items[j+1] = items[j]; } items[j+1] = value; } return items; };