JavaScript 冒泡排序算法实现

function bubbleSort(arr) { let len = arr.length; for (let i = 0; i < len; i++) { for (let j = 0; j < len - 1 - i; j++) { if (arr[j] > arr[j + 1]) { [arr[j], arr[j + 1]] = [arr[j + 1], arr[j]]; } } } return arr; }

// example usage: const unsortedArray = [9, 3, 6, 1, 8, 5, 7, 2, 4]; const sortedArray = bubbleSort(unsortedArray); console.log(sortedArray); // [1, 2, 3, 4, 5, 6, 7, 8, 9]