最近開始學習資料結構,一點一點整理,希望能堅持下去。因為方向是前端,所以用 JavaScript 來實作。
var testArr1 = [3, 44, 38, 5, 47, 15, 36, 26, 27, 2, 46, 4, 19, 50, 48];
var testArr2 = [3, 44, 38, 5, 47, 15, 36, 26, 27, 2, 46, 4, 19, 50, 48];
var testArr3 = [3, 44, 38, 5, 47, 15, 36, 26, 27, 2, 46, 4, 19, 50, 48];
testArr1.sort(); // 按字典序:[15, 19, 2, 26, 27, 3, ...]
testArr2.sort(function(a, b){ return a > b }); // [2, 3, 4, 5, 15, 19, 26, ...]
testArr3.sort(function(a, b){ return a - b }); // [2, 3, 4, 5, 15, 19, 26, ...]
var testArr1 = [3, 44, 38, 5, 47, 15, 36, 26, 27, 2, 46, 4, 19, 50, 48];
var testArr2 = [3, 44, 38, 5, 47, 15, 36, 26, 27, 2, 46, 4, 19, 50, 48];
function bubbleSort1(array){
for(i = array.length - 1; i > 0; i--){
for(j = 0; j < i; j++){
if(array[j + 1] < array[j]){
var temp = array[j + 1];
array[j + 1] = array[j];
array[j] = temp;
}
}
}
}
function bubbleSort2(array){
for(i = array.length - 1; i > 0; i--){
for(j = 0; j < i; j++){
if((array[j + 1] - array[j]) < 0){
var temp = array[j + 1];
array[j + 1] = array[j];
array[j] = temp;
}
}
}
}
// 結果:[2,3,4,5,15,19,26,27,36,38,44,46,47,48,50]
var testArr = [3, 44, 38, 5, 47, 15, 36, 26, 27, 2, 46, 4, 19, 50, 48];
function selectSort(array){
for(i = 0; i < array.length; i++){
var slc = array[i]; // 初始時設未排序的第一個值為選中值
var slcIdx; // 記錄一次循環後作為選中值的 index
for(j = i; j < array.length; j++){
if(array[j] < slc){
slc = array[j];
slcIdx = j;
}
}
if(slc != array[i]){ // 若最終選中值與初始值不同,則交換
var temp = array[i];
array[i] = array[slcIdx];
array[slcIdx] = temp;
}
}
}
// 結果:[2,3,4,5,15,19,26,27,36,38,44,46,47,48,50]
var testArr = [3, 44, 38, 5, 47, 15, 36, 26, 27, 2, 46, 4, 19, 50, 48];
function insertSort(array){
// 注意 i 小於陣列長度 - 1,否則會造成陣列越界
for (var i = 0; i < array.length - 1; i++){
var curElement = array[i + 1];
for (var j = i; j >= 0; j--){
if(curElement < array[j]){
array[j + 1] = array[j];
if(j == 0){ // 已排到陣列最開頭
array[0] = curElement;
}
}else{
array[j + 1] = curElement;
break;
}
}
}
}
// 結果:[2,3,4,5,15,19,26,27,36,38,44,46,47,48,50]