冒泡排序

    技术2024-07-05  83

    for (var i = 0; i < arr.length - 1; i++) { for (var j = 0; j < arr.length - 1 - i; j++) { if (arr[j] > arr[j + 1]) { var ls = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = ls; } } } console.log(arr);
    Processed: 0.009, SQL: 9