利用函数冒泡排序

 

 

 <script>
    function sort(arr) {
      for (let i = 0; i < arr.length - 1; i++) {
        for (let j = 0; j < arr.length - i - 1; j++) {
          if (arr[j] > arr[j + 1]) {
            var temp = arr[j];
            arr[j] = arr[j + 1];
            arr[j + 1] = temp;
          }
        }
      }
      return arr;
    }
    let arr1 = sort([3, 5, 1, 2, 4, 7]);
    console.log(arr1);
    let arr2 = sort([11, 21, 19, 32, 15]);
    console.log(arr2);
  </script>