perf: 升级依赖版本,支持锁定node18.18

code/ds/BinaryInsertSort.js

@@ -7,9 +7,11 @@ function binaryInsertSort(arr, len) {
     ? len
     : arr.length
 
+  // 遍历
   for (let i = 1; i < len; i++) {
     const temp = arr[i]
-    let lowIndex = 0; let highIndex = i - 1
+    let lowIndex = 0
+    let highIndex = i - 1
 
     while (lowIndex <= highIndex) {
       // 注意：取整,javascript这里取整，会出现空指针
@@ -29,15 +31,14 @@ function binaryInsertSort(arr, len) {
     }
     arr[highIndex + 1] = temp
   }
-
   // 返回经过折半插入排序处理的有序数组
   return arr
 }
 
 
+// 测试用例
 const dealArr = [5, 2, 7, 3, 18, 8, 12, 1]
 console.log('插入排序前：', dealArr)
 const sortResult = binaryInsertSort(dealArr, 7)
-
 console.log('插入排序后：', sortResult)